会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • FULFILLING QUERIES USING SPECIFIED AND UNSPECIFIED ATTRIBUTES
    • 使用指定和未经验证的属性的丰富的查询
    • US20120226679A1
    • 2012-09-06
    • US13038409
    • 2011-03-02
    • Sreenivas GollapudiSayan Bhattacharya
    • Sreenivas GollapudiSayan Bhattacharya
    • G06F17/30
    • G06F17/30958
    • A query is received and processed to determine one or more specified and unspecified attributes in the query. The specified and unspecified attributes may correspond to attributes of one or more items. A graph is generated for the items and includes a node for each item and an edge between each unique pair of nodes. Each node is assigned a cost based on a distance between the specified attributes of the query and the attributes of the item associated with the node. Each edge is assigned a weight based on a distance between the unspecified attributes associated with the nodes of the node pair corresponding to the edge. A set of nodes from the graph is selected by minimizing a total cost of the nodes while maximizing a dispersion of the nodes based on the edge weights.
    • 接收并处理查询以确定查询中的一个或多个指定和未指定的属性。 指定和未指定的属性可以对应于一个或多个项目的属性。 为项目生成图形,并包括每个项目的节点和每个唯一的节点对之间的边。 根据查询的指定属性与与节点相关联的项目的属性之间的距离,为每个节点分配一个成本。 基于与边缘对应的节点对的节点相关联的未指定属性之间的距离,为每个边缘分配权重。 通过最小化节点的总成本,同时基于边缘权重最大化节点的色散来选择来自图形的一组节点。
    • 2. 发明授权
    • Fulfilling queries using specified and unspecified attributes
    • 使用指定的和未指定的属性来完成查询
    • US09053208B2
    • 2015-06-09
    • US13038409
    • 2011-03-02
    • Sreenivas GollapudiSayan Bhattacharya
    • Sreenivas GollapudiSayan Bhattacharya
    • G06F17/30
    • G06F17/30958
    • A query is received and processed to determine one or more specified and unspecified attributes in the query. The specified and unspecified attributes may correspond to attributes of one or more items. A graph is generated for the items and includes a node for each item and an edge between each unique pair of nodes. Each node is assigned a cost based on a distance between the specified attributes of the query and the attributes of the item associated with the node. Each edge is assigned a weight based on a distance between the unspecified attributes associated with the nodes of the node pair corresponding to the edge. A set of nodes from the graph is selected by minimizing a total cost of the nodes while maximizing a dispersion of the nodes based on the edge weights.
    • 接收并处理查询以确定查询中的一个或多个指定和未指定的属性。 指定和未指定的属性可以对应于一个或多个项目的属性。 为项目生成图形,并包括每个项目的节点和每个唯一的节点对之间的边。 根据查询的指定属性与与节点相关联的项目的属性之间的距离,为每个节点分配一个成本。 基于与边缘对应的节点对的节点相关联的未指定属性之间的距离,为每个边缘分配权重。 通过最小化节点的总成本,同时基于边缘权重最大化节点的色散来选择来自图形的一组节点。
    • 5. 发明授权
    • Semi-supervised part-of-speech tagging
    • 半监督的词性标签
    • US08099417B2
    • 2012-01-17
    • US11954216
    • 2007-12-12
    • Sreenivas GollapudiRina Panigrahy
    • Sreenivas GollapudiRina Panigrahy
    • G06F17/30
    • G06F17/30864
    • Relevant search results for a given query may be determined using click data for the query and the number of times the query is issued to a search engine. The number of clicks that a result receives for the given query may provide a feedback mechanism to the search engine on how relevant the result is for the given query. The frequency of a query along with the associated clicks provides the search engine with the effectiveness of the query in producing relevant results. Edges in a graph of queries versus results may be weighted in accordance with the click data and the efficiency to rank the search results provided to a user.
    • 给定查询的相关搜索结果可以使用查询的点击数据和查询发布到搜索引擎的次数来确定。 结果为给定查询获得的点击次数可以向搜索引擎提供关于给定查询的结果的相关性的反馈机制。 查询的频率以及相关的点击次数为搜索引擎提供了生成相关结果时查询的有效性。 可以根据点击数据和提供给用户的搜索结果的效率来加权查询与结果图表中的边。
    • 6. 发明授权
    • Large graph measurement
    • 大图测量
    • US08090729B2
    • 2012-01-03
    • US12396514
    • 2009-03-03
    • Sreenivas Gollapudi
    • Sreenivas Gollapudi
    • G06F17/30G06F7/00
    • G06F17/30876G06F17/30873
    • As provided herein, a pairwise distance between nodes in a large graph can be determined efficiently. URL-sketches are generated for respective nodes in an index by extracting labels from respective nodes, which provide a reference to a link between the nodes, aggregating the labels into sets for respective nodes, and storing the sets of labels as URL-sketches. Neighborhood-sketches are generated for the respective nodes in the index using the URL-sketches, by determining a neighborhood for a node and generating a sketch using labels that are associated with the respective neighboring nodes. A distance between two nodes is determined by computing an approximate number of paths and an approximate path length between the two nodes, using the neighborhood sketches for the two nodes.
    • 如本文所提供的,可以有效地确定大图中的节点之间的成对距离。 通过从相应节点提取标签,提供对节点之间的链接的引用,将标签聚集到各个节点的集合中,并将标签集合存储为URL草图,从而为索引中的相应节点生成URL草图。 通过使用URL草图,通过确定节点的邻域并使用与各个相邻节点相关联的标签生成草图来为索引中的相应节点生成邻域草图。 通过使用两个节点的邻域草图计算两个节点之间的近似路径数和两个节点之间的近似路径长度来确定两个节点之间的距离。
    • 8. 发明申请
    • SEMI-SUPERVISED PART-OF-SPEECH TAGGING
    • 半监督的部分话题标签
    • US20090157643A1
    • 2009-06-18
    • US11954216
    • 2007-12-12
    • Sreenivas GollapudiRina Panigrahy
    • Sreenivas GollapudiRina Panigrahy
    • G06F17/30
    • G06F17/30864
    • Relevant search results for a given query may be determined using click data for the query and the number of times the query is issued to a search engine. The number of clicks that a result receives for the given query may provide a feedback mechanism to the search engine on how relevant the result is for the given query. The frequency of a query along with the associated clicks provides the search engine with the effectiveness of the query in producing relevant results. Edges in a graph of queries versus results may be weighted in accordance with the click data and the efficiency to rank the search results provided to a user.
    • 给定查询的相关搜索结果可以使用查询的点击数据和查询发布到搜索引擎的次数来确定。 结果为给定查询获得的点击次数可以向搜索引擎提供关于给定查询的结果的相关性的反馈机制。 查询的频率以及相关的点击次数为搜索引擎提供了生成相关结果时查询的有效性。 可以根据点击数据和提供给用户的搜索结果的效率来加权查询与结果图表中的边。
    • 9. 发明授权
    • Extensible framework for transferring session state
    • 可扩展的会话状态转移框架
    • US07415522B2
    • 2008-08-19
    • US10917843
    • 2004-08-12
    • Sanjay KaluskarSreenivas Gollapudi
    • Sanjay KaluskarSreenivas Gollapudi
    • G06F15/16G06F12/00
    • G06F17/30575H04L67/148
    • Techniques allow a client to be switched from a session on a server to another session on another server in a way that is a transparent to the application for which the initial session was established. Thus, under transparent session migration, a client is switched between sessions without executing application instructions tailored to accomplish the migration. Instead, a client-side interface component, through which the application interacts with the server, handles details of migration, modifying the internal state of the client-side interface component to effect the same. Legacy applications do not have to be modified in order to institute techniques described herein.
    • 技术允许客户端以对初始会话建立的应用程序透明的方式从服务器上的会话切换到另一个服务器上的另一个会话。 因此,在透明会话迁移下,客户端在会话之间切换,而不执行为完成迁移而定制的应用程序指令。 相反,应用程序与服务器交互的客户端接口组件处理迁移的细节,修改客户端接口组件的内部状态来实现。 传统的应用程序不需要修改,以便建立这里描述的技术。