利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

13 条记录 (耗时 0.014 秒)

    Efficient Electronic Document Ranking For Internet Resources in Sub-linear Time
    2.
    发明申请
    Efficient Electronic Document Ranking For Internet Resources in Sub-linear Time 审中-公开
    用于亚线性时间的Internet资源的高效电子文档排名

    公开(公告)号：US20130226934A1

    公开(公告)日：2013-08-29

    申请号：US13405419

    申请日：2012-02-27

    申请人： Michael A. Brautbar ,  Christian Herwarth Borgs ,  Jennifer Tour Chayes ,  Shanghua Teng

    发明人： Michael A. Brautbar ,  Christian Herwarth Borgs ,  Jennifer Tour Chayes ,  Shanghua Teng

    IPC分类号： G06F17/30 ,  G06Q30/02

    CPC分类号： G06Q30/02 ,  G06F16/951

    摘要： The subject disclosure is directed towards ranking electronic documents in sub-linear time complexity. An advertising provider may perform such a ranking in order to identify one or more electronic document to advertise a product or service. A ranking mechanism may execute a number of random walks around the Internet by navigating the electronic documents via embedded links from a starting document and an ending document that are within a pre-determined distance. After finishing the random walks, an estimate of rank contribution information associated with each electronic document is provided. The estimated rank contribution information is used to determine an exposure level with respect to a network for one or more of the electronic documents. The exposure value of an example electronic document may correspond to a ranking value that may be computed using a sample of the rank contribution information related to that document.

    摘要翻译： 该主题公开涉及以亚线性时间复杂度排列电子文档。 广告提供者可以执行这样的排名，以便识别一个或多个电子文档来宣传产品或服务。 排序机制可以通过经由来自起始文档和预定距离内的结束文档的嵌入式链接导航电子文档来执行互联网周围的多个随机游走。 在完成随机散步之后，提供与每个电子文档相关联的排名贡献信息的估计。 估计的等级分配信息用于确定关于一个或多个电子文档的网络的曝光水平。 示例电子文档的曝光值可以对应于可以使用与该文档相关的等级提供信息的样本来计算的排名值。

    PROMOTIONAL GAMES ARCHITECTURE
    4.
    发明申请
    PROMOTIONAL GAMES ARCHITECTURE 有权
    促销游戏建筑

    公开(公告)号：US20080200252A1

    公开(公告)日：2008-08-21

    申请号：US11677308

    申请日：2007-02-21

    申请人： Christian Herwarth Borgs ,  Kamal Jain ,  Neal Freeland

    发明人： Christian Herwarth Borgs ,  Kamal Jain ,  Neal Freeland

    IPC分类号： A63F9/24

    CPC分类号： G06Q30/02

    摘要： The claimed subject matter relates to an architecture that can facilitate promotion of an online service. The architecture can provide for a games platform that can host a variety of games. The hosted games can be designed such that a user's experiences can be enhanced by game cards that can be discovered and retrieved while using the online service being promoted. Accordingly, the user's experiences can be enhanced as a function of the usage of the online service being promoted.

    摘要翻译： 所要求保护的主题涉及可以促进在线服务的推广的架构。 该架构可以提供一个可以承载各种游戏的游戏平台。 可以设计托管游戏，使得可以在使用在线服务被提升时可以发现和检索的游戏卡来增强用户的体验。 因此，作为在线服务的使用被推广的功能，可以增强用户的体验。

    LOCAL COMPUTATION OF RANK CONTRIBUTIONS
    7.
    发明申请
    LOCAL COMPUTATION OF RANK CONTRIBUTIONS 有权
    排名贡献的本地计算

    公开(公告)号：US20090030916A1

    公开(公告)日：2009-01-29

    申请号：US12124239

    申请日：2008-05-21

    申请人： Reid Marlow Andersen ,  Christian Herwarth Borgs ,  Jennifer Tour Chayes ,  Krishna C. Gade ,  John E. Hopcroft ,  Vahab Mirrokni ,  Shang-Hua Teng

    发明人： Reid Marlow Andersen ,  Christian Herwarth Borgs ,  Jennifer Tour Chayes ,  Krishna C. Gade ,  John E. Hopcroft ,  Vahab Mirrokni ,  Shang-Hua Teng

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30864

    摘要： The claimed subject matter relates to an architecture that can identify, store, and/or output local contributions to a rank of a vertex in a directed graph. The architecture can receive a directed graph and a parameter, and examine a local subset of vertices (e.g., local to a given vertex) in order to determine a local supporting set. The local supporting set can include a local set of vertices that each contributes a minimum fraction of the parameter to a rank of the vertex. The local supporting set can be the basis for an estimate of the supporting set and/or rank of the vertex for the entire graph and can be employed as a means for detecting link or web spam as well as other influence-based social network applications.

    摘要翻译： 所要求保护的主题涉及可以识别，存储和/或输出有向图中的顶点等级的局部贡献的架构。 架构可以接收有向图和参数，并检查顶点的局部子集（例如，给定顶点的局部），以便确定本地支持集。 本地支持集可以包括一组局部顶点，每个顶点将参数的最小部分贡献给顶点的等级。 本地支持集可以作为对整个图的顶点的支持集和/或等级的估计的基础，并且可以用作检测链接或网络垃圾邮件以及其他基于影响的社交网络应用的手段。

    UNIFIED PLATFORM FOR REPUTATION AND SECURE TRANSACTIONS
    8.
    发明申请
    UNIFIED PLATFORM FOR REPUTATION AND SECURE TRANSACTIONS 审中-公开
    统一平台和安全交易平台

    公开(公告)号：US20080301055A1

    公开(公告)日：2008-12-04

    申请号：US11755987

    申请日：2007-05-31

    申请人： Christian Herwarth Borgs ,  Jennifer Tour Chayes ,  Nicole S. Immorlica ,  Kamal Jain ,  Vahab Mirrokni

    发明人： Christian Herwarth Borgs ,  Jennifer Tour Chayes ,  Nicole S. Immorlica ,  Kamal Jain ,  Vahab Mirrokni

    IPC分类号： G06Q30/00 ,  H04L9/32

    CPC分类号： G06Q20/02 ,  G06Q20/356 ,  G06Q20/382 ,  G06Q20/40 ,  G06Q30/06 ,  G06Q30/0601

    摘要： The claimed subject matter provides a unified platform system and/or a method that facilitates optimizing an online transaction. The unified platform system can include a secured transaction component that can secure a portion of transactional data related to an online transaction between at least one buyer and at least one merchant utilizing a secure transaction technique. The unified platform system can include a reputation assessment component that can receive a portion of reputation data related to at least one of the buyer or the merchant based at least in part upon verifying completion of the online transaction between such buyer and merchant. The unified platform system can publish the portion of reputation data coupled with a portion of non-private transactional data to provide context for the reputation data.

    摘要翻译： 所要求保护的主题提供了有利于优化在线交易的统一平台系统和/或方法。 统一平台系统可以包括安全交易组件，其可以利用安全交易技术来确保在至少一个买方和至少一个商家之间的在线交易相关的一部分事务数据。 统一平台系统可以包括信誉评估组件，其至少部分地基于验证在这种买方和商家之间的在线交易的完成来接收与至少一个买方或商家相关的一部分信誉数据。 统一的平台系统可以发布与非私有事务数据的一部分相结合的信誉数据部分，为信誉数据提供上下文。

    Local computation of rank contributions
    9.
    发明授权
    Local computation of rank contributions 有权
    地方计算等级的贡献

    公开(公告)号：US08438189B2

    公开(公告)日：2013-05-07

    申请号：US12124239

    申请日：2008-05-21

    申请人： Reid Marlow Andersen ,  Christian Herwarth Borgs ,  Jennifer Tour Chayes ,  Krishna C. Gade ,  John E. Hopcroft ,  Vahab Mirrokni ,  Shang-Hua Teng

    发明人： Reid Marlow Andersen ,  Christian Herwarth Borgs ,  Jennifer Tour Chayes ,  Krishna C. Gade ,  John E. Hopcroft ,  Vahab Mirrokni ,  Shang-Hua Teng

    IPC分类号： G06F7/00 ,  G06F17/30

    CPC分类号： G06F17/30864

    摘要： The claimed subject matter relates to an architecture that can identify, store, and/or output local contributions to a rank of a vertex in a directed graph. The architecture can receive a directed graph and a parameter, and examine a local subset of vertices (e.g., local to a given vertex) in order to determine a local supporting set. The local supporting set can include a local set of vertices that each contributes a minimum fraction of the parameter to a rank of the vertex. The local supporting set can be the basis for an estimate of the supporting set and/or rank of the vertex for the entire graph and can be employed as a means for detecting link or web spam as well as other influence-based social network applications.

    摘要翻译： 所要求保护的主题涉及可以识别，存储和/或输出有向图中的顶点等级的局部贡献的架构。 架构可以接收有向图和参数，并检查顶点的局部子集（例如，给定顶点的局部），以便确定本地支持集。 本地支持集可以包括一组局部顶点，每个顶点将参数的最小部分贡献给顶点的等级。 本地支持集可以作为对整个图的顶点的支持集和/或等级的估计的基础，并且可以用作检测链接或网络垃圾邮件以及其他基于影响的社交网络应用的手段。