会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Methods for ranking nodes in large directed graphs
    • 大型定向图中节点排序的方法
    • US20050033742A1
    • 2005-02-10
    • US10646331
    • 2003-08-22
    • Sepandar KamvarTaher HaveliwalaGlen JehGene Golub
    • Sepandar KamvarTaher HaveliwalaGlen JehGene Golub
    • G06F17/30
    • G06F17/30864Y10S707/99935Y10S707/99937
    • Techniques for assigning ranks to nodes in a large linked database, such as world wide web or any other hypermedia database, partition the nodes so that the link matrix has a predominantly block-diagonal form. Within each block, a local rank is computed for nodes in the block, possibly by different computer in a distributed computing environment. A block rank is then estimated for each block as a whole, and may optionally include block-level weights to implement customized ranking. The local ranks and block ranks are then combined to form a global rank, which may be used to rank the nodes. Alternatively, a global rank vector for the database may be used as an initial vector in an iterative link-based ranking scheme to obtain more accurate global ranks for the nodes. The global rank vector may be divided to provide local rank vectors for use in subsequent applications of the method.
    • 将等级分配给大型链接数据库(例如万维网或任何其他超媒体数据库)中的节点的技术对节点进行分区,使得链路矩阵具有主要的块对角线形式。 在每个块内,可以通过分布式计算环境中的不同计算机为块中的节点计算局部秩。 然后,对于每个块作为整体估计块等级,并且可以可选地包括块级权重以实现定制排名。 然后组合本地队列和块队列以形成全局等级,可用于对节点进行排序。 或者,可以将数据库的全局秩向量用作基于迭代链路的排序方案中的初始向量,以获得节点的更准确的全局等​​级。 全局秩矢量可以被划分以提供用于该方法的随后应用的局部秩矢量。
    • 2. 发明申请
    • Anticipated query generation and processing in a search engine
    • 搜索引擎中预期的查询生成和处理
    • US20050283468A1
    • 2005-12-22
    • US10875143
    • 2004-06-22
    • Sepandar KamvarTaher HaveliwalaGlen Jeh
    • Sepandar KamvarTaher HaveliwalaGlen Jeh
    • G06F7/00G06F17/30
    • G06F17/30646G06F17/3064
    • A search system monitors the input of a search query by a user. Before the user finishes entering the search query, the search system identifies and sends a portion of the query as a partial query to the search engine. Based on the partial query, the search engine creates a set of predicted queries. This process may take into account prior queries submitted by a community of users, and may take into account a user profile. The predicted queries are be sent back to the user for possible selection. The search system may also cache search results corresponding to one or more of the predicted queries in anticipation of the user selecting one of the predicted queries. The search engine may also return at least a portion of the search results corresponding to one or more of the predicted queries.
    • 搜索系统监视用户对搜索查询的输入。 在用户完成输入搜索查询之前,搜索系统将查询的一部分作为部分查询识别并发送到搜索引擎。 基于部分查询,搜索引擎创建一组预测查询。 此过程可能会考虑用户社区提交的先前查询,并可能会考虑用户个人资料。 预测的查询将被发送回用户以进行可能的选择。 搜索系统还可以缓存对应于一个或多个预测查询的搜索结果,预期用户选择预测查询之一。 搜索引擎还可以返回对应于一个或多个预测查询的搜索结果的至少一部分。
    • 3. 发明授权
    • System and method for presenting multiple sets of search results for a single query
    • 用于呈现单个查询的多组搜索结果的系统和方法
    • US08600963B2
    • 2013-12-03
    • US10641489
    • 2003-08-14
    • Taher HaveliwalaGlen JehSepandar Kamvar
    • Taher HaveliwalaGlen JehSepandar Kamvar
    • G06F7/00
    • G06F17/30864G06F17/3053
    • A system and a method that manages a user query by a single interaction between a server and a client. A plurality of clients send queries for search results to a server. The server receives these queries and performs multiple searches to generate multiple sets of search results. These sets of search results are ranked, consolidated and passed to the requesting client. The client stores these multiple sets of search results. The client then displays these search results in accordance to the boundary defined by the user. This boundary defines the portions of the search results that the user desires to view. The user may re-define the boundary. The client identifies the search results corresponding to the boundary and displays them.
    • 通过服务器和客户端之间的单个交互来管理用户查询的系统和方法。 多个客户端向服务器发送搜索结果查询。 服务器接收这些查询并执行多次搜索以生成多组搜索结果。 这些搜索结果集合被排序,合并并传递给请求客户端。 客户端存储这些多组搜索结果。 然后,客户端根据用户定义的边界显示这些搜索结果。 该边界定义用户希望查看的搜索结果的部分。 用户可以重新定义边界。 客户端识别与边界对应的搜索结果并显示它们。
    • 4. 发明申请
    • Website flavored search
    • 网站风味搜索
    • US20070239680A1
    • 2007-10-11
    • US11394620
    • 2006-03-30
    • Bilgehan OztekinAdam KleinTaher HaveliwalaGlen JehSepandar Kamvar
    • Bilgehan OztekinAdam KleinTaher HaveliwalaGlen JehSepandar Kamvar
    • G06F17/30
    • G06F17/30867
    • In a method of profiling a website, an information server receives multiple search queries from a website submitted by different users. Different search results responsive to the search queries are provided to the requesting users. The information server monitors activities of the users on the search results and generates a profile for the website using the search queries and the user activities. When the information server receives a same search query from two different websites, it identifies a plurality of information items associated with the search query. The information server uses profiles of the two websites to customize the information items into two different orders and serves the information items to the two websites in the two different orders.
    • 在对网站进行分析的方法中,信息服务器从不同用户提交的网站接收多个搜索查询。 响应于搜索查询的不同搜索结果被提供给请求用户。 信息服务器监视用户对搜索结果的活动,并使用搜索查询和用户活动生成网站的个人资料。 当信息服务器从两个不同的网站接收到相同的搜索查询时,它识别与搜索查询相关联的多个信息项。 信息服务器使用两个网站的配置文件将信息项目定制成两个不同的顺序,并以两个不同的顺序向两个网站提供信息项。
    • 8. 发明授权
    • Methods for ranking nodes in large directed graphs
    • 大型定向图中节点排序的方法
    • US07216123B2
    • 2007-05-08
    • US10646331
    • 2003-08-22
    • Sepandar D. KamvarTaher H. HaveliwalaGlen JehGene Golub
    • Sepandar D. KamvarTaher H. HaveliwalaGlen JehGene Golub
    • G06F17/30
    • G06F17/30864Y10S707/99935Y10S707/99937
    • Techniques for assigning ranks to nodes in a large linked database, such as world wide web or any other hypermedia database, partition the nodes so that the link matrix has a predominantly block-diagonal form. Within each block, a local rank is computed for nodes in the block, possibly by different computer in a distributed computing environment. A block rank is then estimated for each block as a whole, and may optionally include block-level weights to implement customized ranking. The local ranks and block ranks are then combined to form a global rank, which may be used to rank the nodes. Alternatively, a global rank vector for the database may be used as an initial vector in an iterative link-based ranking scheme to obtain more accurate global ranks for the nodes. The global rank vector may be divided to provide local rank vectors for use in subsequent applications of the method.
    • 将等级分配给大型链接数据库(例如万维网或任何其他超媒体数据库)中的节点的技术对节点进行分区,使得链路矩阵具有主要的块对角线形式。 在每个块内,可以通过分布式计算环境中的不同计算机为块中的节点计算局部秩。 然后,对于每个块作为整体估计块等级,并且可以可选地包括块级权重以实现定制排名。 然后组合本地队列和块队列以形成全局等级,可用于对节点进行排序。 或者,可以将数据库的全局秩向量用作基于迭代链路的排序方案中的初始向量,以获得节点的更准确的全局等​​级。 全局秩矢量可以被划分以提供用于该方法的随后应用的局部秩矢量。