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

1. 发明授权

US09171045B2 Recommending queries according to mapping of query communities 有权
标题翻译：根据查询社区的映射推荐查询
公开(公告)号：US09171045B2
公开(公告)日：2015-10-27
申请号：US12943951
申请日：2010-11-11
申请人： Nina Mishra , Sreenivas Gollapudi , Srikanth Jagabathula
发明人： Nina Mishra , Sreenivas Gollapudi , Srikanth Jagabathula
IPC分类号： G06F17/30
CPC分类号： G06F17/30528 , G06F17/3097
摘要： A set of queries, such as a search log, is divided into commercial queries and non-commercial queries. A first set of query communities is determined from the non-commercial queries and a second set is determined from the commercial queries. The query communities are correlated based on the users who submitted the queries and instances where a query from the first set of query communities was followed by a query from the second set to generate a mapping between the first set of query communities and the second set. Later, a non-commercial query is received from a user, and the mapping is used to predict one or more commercial queries that the user is likely to submit in the future based on the non-commercial query. One or more of the commercial queries are presented to the user according to the mapping with search results responsive to the non-commercial query.
摘要翻译：诸如搜索日志的一组查询被分为商业查询和非商业查询。从非商业查询确定第一组查询社区，并从商业查询中确定第二组。查询社区是基于提交查询的用户和来自第一组查询社区的查询后跟来自第二组的查询的用户相关联的，以生成第一组查询社区和第二组之间的映射。之后，从用户接收到非商业查询，并且映射用于基于非商业查询来预测用户将来可能提交的一个或多个商业查询。根据与响应于非商业查询的搜索结果的映射，向用户呈现一个或多个商业查询。

2. 发明授权

US08612432B2 Determining query intent 有权
标题翻译：确定查询意图
公开(公告)号：US08612432B2
公开(公告)日：2013-12-17
申请号：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分类号： G06F7/00 , G06F17/30 , G06F15/18
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.
摘要翻译：树结构具有与项目类别的层次结构的每个类别相关联的节点。树的子节点与与父节点相关联的类别的子类别相关联。通过将每个查询与对应于所选择的查询类别的节点相关联，将包括接收到的查询和针对每个接收到的查询的所选项目类别的指示符的训练数据与树结构组合。当接收到查询时，分类器被应用于节点以产生查询旨在匹配与节点相关联的类别的项目的概率。应用分类器直到概率低于阈值。选择与接收到的查询的意图最接近的节点相关联的一个或多个类别，并输出与接收到的查询匹配的那些类别的项目的指示符。

3. 发明申请

US20120276992A1 MOST VALUABLE PLAYER GAMER STATUS AND APPLICATIONS 审中-公开
标题翻译：最有价值的游戏玩家状态和应用
公开(公告)号：US20120276992A1
公开(公告)日：2012-11-01
申请号：US13095499
申请日：2011-04-27
申请人： MOHAMMED MOINUDDIN , JOSEPH FUTTY , DAN E. WALTHER , SREENIVAS GOLLAPUDI , DANNY LANGE , SRIPRIYA PRASHANTHI VASUDEVAN , MILLER THOMAS ABEL , STELIOS PAPARIZOS , JOHN C. SHAFER
发明人： MOHAMMED MOINUDDIN , JOSEPH FUTTY , DAN E. WALTHER , SREENIVAS GOLLAPUDI , DANNY LANGE , SRIPRIYA PRASHANTHI VASUDEVAN , MILLER THOMAS ABEL , STELIOS PAPARIZOS , JOHN C. SHAFER
IPC分类号： A63F13/00
CPC分类号： A63F13/798 , A63F13/61 , A63F13/86 , A63F2300/5506 , A63F2300/5566 , A63F2300/609
摘要： A gaming environment is provided by an MVP gaming system provider in which “most valuable player” (MVP) gamers may compete. MVP gamers may be identified using achievements, gamer scores, game play during sanctioned gaming events, or other indicia of game skills. The MVP gamers may be sponsored by advertisers, and the MVP gamers' avatars may be branded based on sponsorship during gaming events. The sponsorships may be brokered by the MVP gaming system provider. Some gaming events may be sanctioned gaming events that are coordinated by the MVP gaming system provider and “televised” to allow viewers to watch the gaming events. Tutorials from MVP gamers may also be provided to gamers for viewing to assist in their game play. Further, gamers may be able to rent the avatars of MVP gamers for use during their game play.
摘要翻译：游戏环境由MVP游戏系统提供商提供，其中最有价值的玩家（MVP）玩家可以竞争。 MVP玩家可以使用成就，玩家分数，在制定的游戏活动期间的游戏或其他游戏技能标记来识别。 MVP玩家可能由广告主赞助，而MVP游戏玩家的头像可能会根据游戏活动期间的赞助进行品牌宣传。赞助可能由MVP游戏系统提供商代理。一些游戏活动可能被认可的游戏活动由MVP游戏系统提供商协调，并通过电视方式让观众观看游戏活动。来自MVP游戏玩家的教程也可以提供给玩家进行观看以协助玩游戏。此外，玩家可能能够租用在游戏中使用的MVP游戏玩家的化身。

4. 发明授权

US08255397B2 Method and apparatus for document clustering and document sketching 有权
标题翻译：用于文档聚类和文档素描的方法和装置
公开(公告)号：US08255397B2
公开(公告)日：2012-08-28
申请号：US12198841
申请日：2008-08-26
申请人： Sreenivas Gollapudi
发明人： Sreenivas Gollapudi
IPC分类号： G06F17/30
CPC分类号： G06F17/30616 , G06F17/3071 , Y10S707/99933 , Y10S707/99935 , Y10S707/99942 , Y10S707/99943
摘要： A first embodiment of the invention provides a system that automatically classifies documents in a collection into clusters based on the similarities between documents, that automatically classifies new documents into the right clusters, and that may change the number or parameters of clusters under various circumstances. A second embodiment of the invention provides a technique for comparing two documents, in which a fingerprint or sketch of each document is computed. In particular, this embodiment of the invention uses a specific algorithm to compute the document's fingerprint. One embodiment uses a sentence in the document as a logical delimiter or window from which significant words are extracted and, thereafter, a hash is computed of all pair-wise permutations. Words are extracted based on their weight in the document, which can be computed using measures such as term frequency and the inverse document frequency.
摘要翻译：本发明的第一实施例提供了一种系统，其基于文档之间的相似性自动地将集合中的文档分类成簇，该文档将新文档自动分类到正确的集群中，并且可以在各种情况下改变集群的数量或参数。本发明的第二实施例提供了一种用于比较两个文档的技术，其中计算每个文档的指纹或草图。特别地，本发明的该实施例使用特定算法来计算文档的指纹。一个实施例将文档中的句子用作提取有效字的逻辑定界符或窗口，此后，计算所有成对排列的散列。根据文档中的权重提取单词，可以使用诸如术语频率和逆文档频率等度量来计算单词。

5. 发明申请

US20110258033A1 EFFECTIVE AD PLACEMENT 审中-公开
标题翻译：有效的放置
公开(公告)号：US20110258033A1
公开(公告)日：2011-10-20
申请号：US12760572
申请日：2010-04-15
申请人： Sreenivas Gollapudi , Rina Panigrahy
发明人： Sreenivas Gollapudi , Rina Panigrahy
IPC分类号： G06Q30/00 , G06F17/30
CPC分类号： G06Q30/0244 , G06F16/972 , G06Q30/02 , G06Q30/0243
摘要： Search results and ads that satisfy a query may be formatted into a search results page where an initial placement of ads may result in an estimated click through rate for the presented ads. An adjustment factor may be determined based on parameters associated with the search results, such as the clicks on the search results themselves. The adjustment factor may be applied to a particular ad to determine if an estimated click through rate of the particular ad will change with respect to a position when there are a first number of mainline ads and a second number of side bar ads. Mainline exclusivity may be appropriate for an ad to increase the click through rate of the ad. The increase may be determined in accordance with the adjustment factor to decide whether to present the ad with mainline exclusivity.
摘要翻译：满足查询的搜索结果和广告可能格式化为搜索结果页面，其中初始展示位置可能会导致展示广告的估算点击率。可以基于与搜索结果相关联的参数（例如搜索结果本身的点击）来确定调整因子。调整因子可以应用于特定广告，以确定当存在第一数量的主线广告和第二数量的边栏广告时，特定广告的估计点击率是否相对于该位置而改变。主线排他性可能适合于增加广告点击率的广告。该增加可以根据调整因素来确定是否呈现具有主线排他性的广告。

6. 发明申请

US20110202846A1 ESTIMATING SHORTEST DISTANCES IN GRAPHS 有权
标题翻译：评估格局中的最短距离
公开(公告)号：US20110202846A1
公开(公告)日：2011-08-18
申请号：US12705630
申请日：2010-02-15
申请人： Marc A. Najork , Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
发明人： Marc A. Najork , Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
IPC分类号： G06F15/16 , G06F3/048
CPC分类号： G06N5/04 , G01C21/3446
摘要： Sketches are generated for each node in a graph. For undirected graphs, each sketch for a node may include an indicator of a node from a seed set of nodes and the shortest distance between the node and the indicated node. When a request is received for the shortest distance between two nodes of the graph, the sketches for each of the two nodes are retrieved, and nodes that are indicated in both of the sketches are determined. The distances between each of the two nodes and a determined node as indicated in the sketches is summed for each of the determined nodes, and the sum having the least distance is selected as the estimated shortest distance between the two nodes.
摘要翻译：为图中的每个节点生成草图。对于无向图，节点的每个草图可以包括来自节点的种子集合的节点的指示符以及节点和指示节点之间的最短距离。当接收到图形的两个节点之间的最短距离的请求时，检索两个节点中的每个节点的草图，并且确定在两个草图中指示的节点。两个节点中的每一个之间的距离和如草图中所示的确定的节点之间的距离对于每个确定的节点相加，并且具有最小距离的和被选择为两个节点之间的估计的最短距离。

7. 发明申请

US20100281022A1 ESTIMATING RANK ON GRAPH STREAMS 有权
标题翻译：估计图表的排名
公开(公告)号：US20100281022A1
公开(公告)日：2010-11-04
申请号：US12434691
申请日：2009-05-04
申请人： Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
发明人： Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
IPC分类号： G06F17/30 , G06N5/04
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.
摘要翻译：图中节点的等级可以从图中的每个节点出现在图的单个随机游走中的计算概率推断。可以为图中的每个节点生成短随机散步。所产生的随机散步可以组合以形成更长的单次随机游走。可以以这种方式产生多个单个随机散步。可以从生成的单个随机游走中计算每个节点出现在单个随机中的概率。然后可以从计算的概率推断每个节点的等级。

8. 发明申请

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

9. 发明授权

US07765204B2 Method of finding candidate sub-queries from longer queries 失效
标题翻译：从较长查询中查找候选子查询的方法
公开(公告)号：US07765204B2
公开(公告)日：2010-07-27
申请号：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是基于查询中的项数的整数。

10. 发明授权

US07747754B2 Transparent migration of stateless sessions across servers 有权
标题翻译：跨服务器透明地迁移无状态会话
公开(公告)号：US07747754B2
公开(公告)日：2010-06-29
申请号：US10917882
申请日：2004-08-12
申请人： Sanjay Kaluskar , Sreenivas Gollapudi
发明人： Sanjay Kaluskar , Sreenivas Gollapudi
IPC分类号： G06F15/16
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.
摘要翻译：技术允许将客户端从对服务器上的客户端建立的会话迁移到另一个服务器上的另一个会话，方式对于初始会话建立的应用程序是透明的。在不需要捕获并将其恢复到目的地会话的情况下，会话将从源节点迁移的会话状态的副本迁移到该会话。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式