会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • System, method, and service for finding an optimal collection of paths among a plurality of paths between two nodes in a complex network
    • 用于在复杂网络中的两个节点之间的多个路径之间找到最佳路径集合的系统,方法和服务
    • US20050243736A1
    • 2005-11-03
    • US10827784
    • 2004-04-19
    • Christos FaloutsosKevin Snow McCurleyAndrew Tomkins
    • Christos FaloutsosKevin Snow McCurleyAndrew Tomkins
    • G06Q10/00H04L1/00
    • G06Q10/04
    • An optimal path selection system extracts a connection subgraph in real time from an undirected, edge-weighted graph such as a social network that best captures the connections between two nodes of the graph. The system models the undirected, edge-weighted graph as an electrical circuit and solves for a relationship between two nodes in the undirected edge-weighted graph based on electrical analogues in the electric graph model. The system optionally accelerates the computations to produce approximate, high-quality connection subgraphs in real time on very large (disk resident) graphs. The connection subgraph is constrained to the integer budget that comprises a first node, a second node and a collection of paths from the first node to the second node that maximizes a “goodness” function g(H). The goodness function g(H) is tailored to capture salient aspects of a relationship between the first node and the second node.
    • 最佳路径选择系统从无向边缘加权图形实时提取连接子图,例如最佳地捕获图形的两个节点之间的连接的社交网络。 该系统将无向边缘加权图形建模为电路,并基于电图模型中的电子类似结果解决了无向边加权图中两个节点之间的关系。 该系统可选地加速计算,以在非常大的(磁盘驻留)图表上实时生成近似,高质量的连接子图。 连接子图被约束到整数预算,该整数预算包括第一节点,第二节点和从第一节点到第二节点的路径集合,其使“好”函数g(H)最大化。 为了捕获第一节点和第二节点之间的关系的显着方面,定义了善意函数g(H)。
    • 4. 发明授权
    • Identifying entities using search results
    • 使用搜索结果识别实体
    • US08843466B1
    • 2014-09-23
    • US13246805
    • 2011-09-27
    • Roni F. ZeigerThomas A. LaskoAndrew TomkinsMichael AngeloMatthew K. GrayRussell RyanNamrata U. Godbole
    • Roni F. ZeigerThomas A. LaskoAndrew TomkinsMichael AngeloMatthew K. GrayRussell RyanNamrata U. Godbole
    • G06F7/00G06F17/30
    • G06F17/30864G06F17/30657
    • Methods, systems, and apparatus, including computer programs encoded on computer storage media, for identifying entities using search results. One of the methods includes determining that a search query includes a respective text reference to each of one or more predetermined attributes, wherein each attribute is associated with an entity type; obtaining search results for the search query from a search engine, each search result identifying a respective resource; for each of a plurality of the obtained search results, determining an initial score for each of a plurality of entities of the entity type based on occurrences of names of the entity in the resource identified by the search result; generating a final score for each of the entities based on the initial scores; and selecting one or more names of entities of the entity type to include in a response to the search query based on the final scores.
    • 方法,系统和装置,包括在计算机存储介质上编码的计算机程序,用于使用搜索结果识别实体。 方法之一包括确定搜索查询包括对一个或多个预定属性中的每一个的相应文本引用,其中每个属性与实体类型相关联; 从搜索引擎获取搜索查询的搜索结果,每个搜索结果标识相应的资源; 对于多个获得的搜索结果中的每一个,基于由搜索结果标识的资源中的实体的名称的出现来确定实体类型的多个实体中的每一个的初始分数; 根据初始分数为每个实体产生最终得分; 以及根据最终分数选择实体类型的实体的一个或多个名称以包括在对搜索查询的响应中。