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

31. 发明申请

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.
摘要翻译：满足查询的搜索结果和广告可能格式化为搜索结果页面，其中初始展示位置可能会导致展示广告的估算点击率。可以基于与搜索结果相关联的参数（例如搜索结果本身的点击）来确定调整因子。调整因子可以应用于特定广告，以确定当存在第一数量的主线广告和第二数量的边栏广告时，特定广告的估计点击率是否相对于该位置而改变。主线排他性可能适合于增加广告点击率的广告。该增加可以根据调整因素来确定是否呈现具有主线排他性的广告。

32. 发明申请

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.
摘要翻译：为图中的每个节点生成草图。对于无向图，节点的每个草图可以包括来自节点的种子集合的节点的指示符以及节点和指示节点之间的最短距离。当接收到图形的两个节点之间的最短距离的请求时，检索两个节点中的每个节点的草图，并且确定在两个草图中指示的节点。两个节点中的每一个之间的距离和如草图中所示的确定的节点之间的距离对于每个确定的节点相加，并且具有最小距离的和被选择为两个节点之间的估计的最短距离。

33. 发明申请

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.
摘要翻译：图中节点的等级可以从图中的每个节点出现在图的单个随机游走中的计算概率推断。可以为图中的每个节点生成短随机散步。所产生的随机散步可以组合以形成更长的单次随机游走。可以以这种方式产生多个单个随机散步。可以从生成的单个随机游走中计算每个节点出现在单个随机中的概率。然后可以从计算的概率推断每个节点的等级。

34. 发明申请

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草图，通过确定节点的邻域并使用与各个相邻节点相关联的标签生成草图来为索引中的相应节点生成邻域草图。通过使用两个节点的邻域草图计算两个节点之间的近似路径数和两个节点之间的近似路径长度来确定两个节点之间的距离。

35. 发明授权

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是基于查询中的项数的整数。

36. 发明授权

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.
摘要翻译：技术允许将客户端从对服务器上的客户端建立的会话迁移到另一个服务器上的另一个会话，方式对于初始会话建立的应用程序是透明的。在不需要捕获并将其恢复到目的地会话的情况下，会话将从源节点迁移的会话状态的副本迁移到该会话。

37. 发明申请

US20090234734A1 BIDDING ON RELATED KEYWORDS 审中-公开
标题翻译：投标相关关键字
公开(公告)号：US20090234734A1
公开(公告)日：2009-09-17
申请号：US12049384
申请日：2008-03-17
申请人： Sreenivas Gollapudi , Frank McSherry , Rina Panigrahy , Kunal Talwar
发明人： Sreenivas Gollapudi , Frank McSherry , Rina Panigrahy , Kunal Talwar
IPC分类号： G06Q30/00 , G06F7/06
CPC分类号： G06Q30/08 , G06Q30/02 , G06Q30/0256
摘要： Advertising slots on a search engine results page may be determined based on keywords and/or results to a user query. Advertisers may use the keywords and/or the results to the query to place their ads into the advertising slots. Rules may be applied to determine how ads are displayed or not displayed. For example, a larger set of keywords may be inferred from the initial set of keywords on which the ad provider placed her bids. This greatly increases the potential reach of an advertiser's ad campaign or a search engine provider's revenue from ad placement.
摘要翻译：搜索引擎结果页面上的广告位可以基于用户查询的关键字和/或结果来确定。广告商可以使用查询的关键字和/或结果将广告投放到广告位。可以应用规则来确定广告的显示方式或不显示。例如，可以从广告提供商将其出价的关键字的初始集合推断出一组较大的关键字。这大大增加了广告客户广告系列或搜索引擎提供商的广告展示位置的收入潜力。

38. 发明授权

US07546613B2 Methods and systems for efficient queue propagation using a single protocol-based remote procedure call to stream a batch of messages 有权
标题翻译：使用单个基于协议的远程过程调用来流式传输一批消息的有效队列传播的方法和系统
公开(公告)号：US07546613B2
公开(公告)日：2009-06-09
申请号：US10942118
申请日：2004-09-14
申请人： Nancy Reiko Ikeda , Ashwinder Singh Ahluwalia , Chao Liang , Krishnan Meiyyappan , Sreenivas Gollapudi , Lakshminarayanan Chidambaran
发明人： Nancy Reiko Ikeda , Ashwinder Singh Ahluwalia , Chao Liang , Krishnan Meiyyappan , Sreenivas Gollapudi , Lakshminarayanan Chidambaran
IPC分类号： G06F3/00 , G06F9/46
CPC分类号： G06F9/546 , G06F9/547 , G06F2209/548
摘要： A computer-implemented method of streaming a plurality of messages from a source queue to at least one destination queue over a computer network. The method may include steps of generating a remote procedure call, the remote procedure being configured to encapsulate at least header data, message data for each of the plurality of messages and an end of batch token, the header data being common to each of the plurality of messages and including an identification of the at least one destination queue, the end of batch token signaling that no further message data follows; sending the generated remote procedure call over the computer network to the destination queue identified in the header data, and dequeueing at least the message data for each of the plurality of messages from the source queue and streaming the dequeued messages over the network, and successively enqueueing each streamed message data into the at least one destination queue identified by the header data until the end of batch token is received.
摘要翻译：一种计算机实现的将多个消息从计算机网络从源队列流送到至少一个目的地队列的方法。所述方法可以包括生成远程过程调用的步骤，所述远程过程被配置为至少封装头部数据，针对所述多个消息中的每个消息的消息数据和批次令牌的结束，所述头部数据对于所述多个消息中的每一个是共同的并且包括所述至少一个目的地队列的标识，批次令牌信令的结束，不再有消息数据跟随; 将生成的远程过程调用通过计算机网络发送到标题数据中标识的目的地队列，并且至少从源队列中排出多个消息中的每一个的消息数据，并通过网络流出出队消息，并且依次排队将每个流式消息数据传送到由标题数据标识的至少一个目的地队列中，直到接收到批量令牌的结束为止。

39. 发明授权

US07487405B1 Method and mechanism for dynamically configuring logical paths of state machines 有权
标题翻译：动态配置状态机逻辑路径的方法和机制
公开(公告)号：US07487405B1
公开(公告)日：2009-02-03
申请号：US10144330
申请日：2002-05-10
申请人： Kapil Surlaker , Sreenivas Gollapudi , Lakshminarayanan Chidambaran , Debashis Saha
发明人： Kapil Surlaker , Sreenivas Gollapudi , Lakshminarayanan Chidambaran , Debashis Saha
IPC分类号： G06F11/00
CPC分类号： G06F17/30985
摘要： A method and mechanism for dynamically changing the logical path of a state machine to avoid conflicts or problems is provided. A toggle state is employed for a state machine that allows dynamic changes in the computation path of a state machine. By analyzing the expected response state of a remote state machine, toggle states can be inserted in the path of a local state machine to avoid conflicts. This approach can be advantageously employed to reduce or prevent half-duplex violations for communications between applications on multiple computing nodes.
摘要翻译：提供了一种用于动态地改变状态机的逻辑路径以避免冲突或问题的方法和机制。对于允许状态机的计算路径的动态变化的状态机采用切换状态。通过分析远程状态机的预期响应状态，可以将切换状态插入到本地状态机的路径中，以避免冲突。可以有利地采用这种方法来减少或防止在多个计算节点上的应用之间的通信的半双工违规。

40. 发明申请

US20080250008A1 Query Specialization 审中-公开
标题翻译：查询专业化
公开(公告)号：US20080250008A1
公开(公告)日：2008-10-09
申请号：US11696455
申请日：2007-04-04
申请人： Sreenivas Gollapudi , Rakesh Agrawal , Evimaria Terzi
发明人： Sreenivas Gollapudi , Rakesh Agrawal , Evimaria Terzi
IPC分类号： G06F17/30
CPC分类号： G06F16/951 , G06F16/3322
摘要： A system, a method and computer-readable media for identifying and presenting potential query refinements for a user's search input. Documents are identified as being responsive to the search input. A query log is accessed to identify previously entered queries that also returned one or more of the identified documents. From these previously entered queries, a portion of the queries are selected as potential query refinements. Thereafter, the potential query refinements are displayed to the user.
摘要翻译：一种用于识别和呈现用户搜索输入的潜在查询改进的系统，方法和计算机可读介质。文件被识别为响应于搜索输入。访问查询日志以识别先前输入的也返回一个或多个已识别文档的查询。从这些以前输入的查询中，一部分查询被选择为潜在的查询优化。此后，向用户显示潜在的查询优化。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式