专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

61. 发明申请

US20090089266A1 METHOD OF FINDING CANDIDATE SUB-QUERIES FROM LONGER QUERIES 失效
标题翻译：从长期查询中查找候选子问题的方法
公开(公告)号：US20090089266A1
公开(公告)日：2009-04-02
申请号：US11863045
申请日：2007-09-27
申请人： Sreenivas Gollapudi , Rina Panigrahy
发明人： Sreenivas Gollapudi , Rina Panigrahy
IPC分类号： G06F17/30
CPC分类号： G06F17/30693 , G06F17/30457
摘要： A method is disclosed for identifying queries stored in a log which are semantically related to an input query that may include a large number of terms. A set of one or more subsequences are generated for each query stored in the log, and these sets of subsequences are stored in a lookup table. A set of one or more subsequences are also generated for the input query. The subsequences in the lookup table and of the input query are generated by hashing of the respective query terms to a value between 0 and 1 using a known technique of min-hashing. The present system then constructs the subsequences of the query using the k-min hashes of the query, where k is an integer based on the number of terms in the query.
摘要翻译：公开了一种用于识别存储在日志中的查询与可能包括大量项目的输入查询语义相关的查询的方法。为存储在日志中的每个查询生成一组或多个子序列，并将这些子序列存储在查找表中。还为输入查询生成一组或多个子序列。查询表和输入查询中的子序列通过使用最小哈希算法的已知技术将相应的查询项散列为0到1之间的值来生成。本系统然后使用查询的k-min哈希构建查询的子序列，其中k是基于查询中的项数的整数。

62. 发明申请

US20060036616A1 Suspending a result set and continuing from a suspended result set for scrollable cursors 有权
标题翻译：暂停结果集并从可滚动光标的挂起结果集继续
公开(公告)号：US20060036616A1
公开(公告)日：2006-02-16
申请号：US11097065
申请日：2005-04-01
申请人： Mehul Bastawala , Lakshminarayanan Chidambaran , Sreenivas Gollapudi , Sanjay Kaluskar , Srinath Krishnaswamy , Debashish Chatterjee
发明人： Mehul Bastawala , Lakshminarayanan Chidambaran , Sreenivas Gollapudi , Sanjay Kaluskar , Srinath Krishnaswamy , Debashish Chatterjee
IPC分类号： G06F7/00
CPC分类号： G06F17/30457
摘要： A system, method, computer program and system for suspending a result set and continuing from a suspended result set for a scrollable cursor is disclosed. The rows from a row source corresponding to the scrollable cursor result set are suspended into storage so that when a fetch is requested the data can be sent (continued) from the suspended storage and does not depend on the original scrollable cursor row source or session to be available.
摘要翻译：公开了一种用于暂停结果集并从用于可滚动游标的暂停结果集继续的系统，方法，计算机程序和系统。来自与可滚动光标结果集相对应的行源的行被暂停到存储器中，使得当请求提取时，可以从挂起的存储器发送（继续）数据，并且不依赖于原始可滚动光标行源或会话能得到的。

63. 发明申请

US20050038828A1 Transparent migration of stateless sessions across servers 有权
标题翻译：跨服务器透明地迁移无状态会话
公开(公告)号：US20050038828A1
公开(公告)日：2005-02-17
申请号：US10917882
申请日：2004-08-12
申请人： Sanjay Kaluskar , Sreenivas Gollapudi
发明人： Sanjay Kaluskar , Sreenivas Gollapudi
IPC分类号： G06F7/00 , G06F15/16 , G06F17/00 , G06F17/30
CPC分类号： G06F17/30575 , H04L67/148
摘要： Techniques allow a client to be migrated from a session that has been established for a client 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. The sessions are migrated under conditions in which a copy of session state of the session to migrate from the source node does not have to be captured and restored to a destination session.
摘要翻译：技术允许将客户端从对服务器上的客户端建立的会话迁移到另一个服务器上的另一个会话，方式对于初始会话建立的应用程序是透明的。在不需要捕获并将其恢复到目的地会话的情况下，会话将从源节点迁移的会话状态的副本迁移到该会话。

64. 发明申请

US20130226713A1 BID DISCOUNTING USING EXTERNALITIES 审中-公开
标题翻译：使用外来物品折价
公开(公告)号：US20130226713A1
公开(公告)日：2013-08-29
申请号：US13407739
申请日：2012-02-28
申请人： Sreenivas Gollapudi , Anand Bhalgat
发明人： Sreenivas Gollapudi , Anand Bhalgat
IPC分类号： G06Q30/02 , G06Q30/08
CPC分类号： G06Q30/02 , G06Q30/08
摘要： Advertisers provide bids for the placement of one or more advertisements on web pages, along with a set of externalities. The externalities from an advertiser indicate discounts that can be applied to their bid based on information learned from a browse history of a user. The externalities may include externalities based on previous viewings of advertisements from the advertiser by the user, externalities based on previous viewings of advertisements from competitor advertisers viewed by the user, and externalities based on web pages or domains that have been visited by the user. When a request for an advertisement is received, the externalities are used to discount the provided bids based on the browse history of the user. An advertisement is then selected based on the discounted bids.
摘要翻译：广告商提供在网页上放置一个或多个广告的出价以及一组外部性。来自广告商的外部性表示可以根据从用户的浏览历史获得的信息来应用于其出价的折扣。外部性可以包括基于用户先前对广告商的广告的观察的外部性，基于用户观看的来自竞争者广告商的广告的先前观看的外部性以及基于用户访问过的网页或域的外部性。当接收到广告请求时，根据用户的浏览历史使用外部性来折扣提供的出价。然后根据折扣出价选择广告。

65. 发明申请

US20120277004A1 BRINGING ACHIEVEMENTS TO AN OFFLINE WORLD 有权
标题翻译：在离岸世界取得成就
公开(公告)号：US20120277004A1
公开(公告)日：2012-11-01
申请号：US13095504
申请日：2011-04-27
申请人： MOHAMMED MOINUDDIN , JOSEPH FUTTY , MATTHEW GRAHAM DYOR , DAN E. WALTHER , SREENIVAS GOLLAPUDI , STELIOS PAPARIZOS , JOHN C. SHAFER
发明人： MOHAMMED MOINUDDIN , JOSEPH FUTTY , MATTHEW GRAHAM DYOR , DAN E. WALTHER , SREENIVAS GOLLAPUDI , STELIOS PAPARIZOS , JOHN C. SHAFER
IPC分类号： G06F17/00
CPC分类号： G06Q30/02
摘要： An achievement system tracks users' offline activities and awards achievements to users for participation in particular offline activities. The achievements that are awarded for particular activities and/or to particular users may be sponsored by merchants, who may compensate an achievement system provider for the opportunity to sponsor the achievements. To award users achievements, the users' offline activities are tracked. When a user participates in an offline activity for which achievements are available, the user is awarded an achievement. The achievement may be stored in an achievement profile for the user. In some embodiments, achievements earned by users may be converted into other benefits and alternative awards.
摘要翻译：成就系统跟踪用户的离线活动，并向用户颁发成绩以参与特定的离线活动。为特定活动和/或特定用户授予的成就可能由商家赞助，商家可能会补偿成就系统提供商以获得成就的机会。为了奖励用户成就，将跟踪用户的离线活动。当用户参与可用成就的离线活动时，用户将获得成就。成就可以存储在用户的成就简档中。在一些实施例中，用户获得的成就可以被转换成其他利益和替代奖励。

66. 发明申请

US20120226679A1 FULFILLING QUERIES USING SPECIFIED AND UNSPECIFIED ATTRIBUTES 有权
标题翻译：使用指定和未经验证的属性的丰富的查询
公开(公告)号：US20120226679A1
公开(公告)日：2012-09-06
申请号：US13038409
申请日：2011-03-02
申请人： Sreenivas Gollapudi , Sayan Bhattacharya
发明人： Sreenivas Gollapudi , Sayan Bhattacharya
IPC分类号： G06F17/30
CPC分类号： 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.
摘要翻译：接收并处理查询以确定查询中的一个或多个指定和未指定的属性。指定和未指定的属性可以对应于一个或多个项目的属性。为项目生成图形，并包括每个项目的节点和每个唯一的节点对之间的边。根据查询的指定属性与与节点相关联的项目的属性之间的距离，为每个节点分配一个成本。基于与边缘对应的节点对的节点相关联的未指定属性之间的距离，为每个边缘分配权重。通过最小化节点的总成本，同时基于边缘权重最大化节点的色散来选择来自图形的一组节点。

67. 发明申请

US20120078927A1 LARGE GRAPH MEASUREMENT 有权
标题翻译：大图测量
公开(公告)号：US20120078927A1
公开(公告)日：2012-03-29
申请号：US13314555
申请日：2011-12-08
申请人： Sreenivas Gollapudi
发明人： Sreenivas Gollapudi
IPC分类号： G06F17/30
CPC分类号： G06F17/30876 , G06F17/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草图，通过确定节点的邻域并使用与各个相邻节点相关联的标签生成草图来为索引中的相应节点生成邻域草图。通过使用两个节点的邻域草图计算两个节点之间的近似路径数和两个节点之间的近似路径长度来确定两个节点之间的距离。

68. 发明申请

US20110314012A1 DETERMINING QUERY INTENT 有权
标题翻译：确定查询内容
公开(公告)号：US20110314012A1
公开(公告)日：2011-12-22
申请号：US12816389
申请日：2010-06-16
申请人： Krishnaram N. G. Kenthapadi , Panayiotis Tsaparas , Sreenivas Gollapudi , Rakesh Agrawal
发明人： Krishnaram N. G. Kenthapadi , Panayiotis Tsaparas , Sreenivas Gollapudi , Rakesh Agrawal
IPC分类号： G06F17/30
CPC分类号： G06F17/30979
摘要： A tree structure has a node associated with each category of a hierarchy of item categories. Child nodes of the tree are associated with sub-categories of the categories associated with parent nodes. Training data including received queries and indicators of a selected item category for each received query is combined with the tree structure by associating each query with the node corresponding to the selected category of the query. When a query is received, a classifier is applied to the nodes to generate a probability that the query is intended to match an item of the category associated with the node. The classifier is applied until the probability is below a threshold. One or more categories associated with the nodes that are closest to the intent of the received query are selected and indicators of items of those categories that match the received query are output.
摘要翻译：树结构具有与项目类别的层次结构的每个类别相关联的节点。树的子节点与与父节点相关联的类别的子类别相关联。通过将每个查询与对应于所选择的查询类别的节点相关联，将包括接收到的查询和针对每个接收到的查询的所选项目类别的指示符的训练数据与树结构组合。当接收到查询时，分类器被应用于节点以产生查询旨在匹配与节点相关联的类别的项目的概率。应用分类器直到概率低于阈值。选择与接收到的查询的意图最接近的节点相关联的一个或多个类别，并输出与接收到的查询匹配的那些类别的项目的指示符。

69. 发明授权

US08073832B2 Estimating rank on graph streams 有权
标题翻译：估计图流的排名
公开(公告)号：US08073832B2
公开(公告)日：2011-12-06
申请号：US12434691
申请日：2009-05-04
申请人： Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
发明人： Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
IPC分类号： G06F17/30
CPC分类号： G06F17/30958
摘要： The rank of nodes in a graph may be inferred from a calculated probability that each node in the graph appears in a single random walk of the graph. Short random walks may be generated for each node in the graph. The generated random walks may be combined to form a longer single random walk. Multiple single random walks may be generated in this fashion. The probability of each node appearing in a single random may be calculated from the generated single random walks. The rank of each node may then be inferred from the calculated probabilities.
摘要翻译：图中节点的等级可以从图中的每个节点出现在图的单个随机游走中的计算概率推断。可以为图中的每个节点生成短随机散步。所产生的随机散步可以组合以形成更长的单次随机游走。可以以这种方式产生多个单个随机散步。可以从生成的单个随机游走中计算每个节点出现在单个随机中的概率。然后可以从计算的概率推断每个节点的等级。

70. 发明申请

US20110264639A1 LEARNING DIVERSE RANKINGS OVER DOCUMENT COLLECTIONS 审中-公开
标题翻译：学习文档集合中的多样性排名
公开(公告)号：US20110264639A1
公开(公告)日：2011-10-27
申请号：US12764112
申请日：2010-04-21
申请人： Aleksandrs Slivkins , Sreenivas Gollapudi , Filip Radlinski
发明人： Aleksandrs Slivkins , Sreenivas Gollapudi , Filip Radlinski
IPC分类号： G06F17/30
CPC分类号： G06F16/9535
摘要： A document selector selects and ranks documents that are relevant to a query. The document selector executes an instance of a multi-armed bandits algorithm to select a document for each slot of a results page according to one or more strategies. The documents are selected in an order defined by the results page and documents selected for previous slots are used to guide the selection of a document for a current slot. If a document in a slot is subsequently selected, the strategy used to select the document is rewarded with positive feedback. When the uncertainty in an estimate of the utility of a strategy is less than the variation between documents associated with the strategy, the strategy is subdivided into multiple strategies. The document selector is able to “zoom in” on effective strategies and provide more relevant search results.
摘要翻译：文档选择器选择和排序与查询相关的文档。文档选择器执行多武装强盗算法的实例，以根据一个或多个策略为结果页面的每个时隙选择文档。文档按照结果页面定义的顺序进行选择，为先前的插槽选择的文档用于指导当前插槽文档的选择。如果随后选择了插槽中的文档，则用于选择文档的策略将获得积极的反馈。当战略效用估计的不确定性低于与战略相关的文件之间的变化时，该策略被细分为多种策略。文档选择器能够“放大”有效策略并提供更相关的搜索结果。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式