ADAPTIVE GREEDY METHOD FOR FAST LIST INTERSECTION VIA SAMPLING
    1.
    发明申请
    ADAPTIVE GREEDY METHOD FOR FAST LIST INTERSECTION VIA SAMPLING 有权
    用于通过采样快速列表交互的自适应GREEDY方法

    公开(公告)号:US20090113309A1

    公开(公告)日:2009-04-30

    申请号:US11923684

    申请日:2007-10-25

    IPC分类号: G06F3/00

    CPC分类号: G06F17/30498 G06F17/30592

    摘要: The embodiments of the invention provide a method of intersecting a group of lists. The method begins by performing a first selecting process including selecting a top list from the group of lists to leave remaining lists. The top list can be the smallest list of the group of lists. The method can also select a pair of lists from the group of lists, such that the pair of lists has the smallest intersection size relative to other pairs of lists of the group of lists. Next, the method estimates intersections of the remaining lists with the top list by estimating an amount of intersection between the remaining lists and the top list. This involves sampling a portion of the remaining lists. The method also includes identifying larger list pairs having smaller intersections sizes when compared to smaller list pairs having larger intersections sizes.

    摘要翻译: 本发明的实施例提供了与一组列表相交的方法。 该方法开始于执行第一选择过程,包括从列表组中选择顶部列表以留下剩余的列表。 顶部列表可以是列表组中最小的列表。 该方法还可以从列表组中选择一对列表,使得该对列表相对于列表组的其他列表对具有最小的相交大小。 接下来,该方法通过估计剩余列表和顶部列表之间的交集量来估计剩余列表与顶部列表的交集。 这涉及对剩余列表的一部分进行抽样。 当与具有较大交叉点尺寸的较小列表对相比较时,该方法还包括识别具有较小交点尺寸的较大列表对。

    Adaptive greedy method for ordering intersecting of a group of lists into a left-deep AND-tree
    2.
    发明授权
    Adaptive greedy method for ordering intersecting of a group of lists into a left-deep AND-tree 有权
    用于将一组列表与左深AND树相交的自适应贪心方法

    公开(公告)号:US07925604B2

    公开(公告)日:2011-04-12

    申请号:US11923684

    申请日:2007-10-25

    IPC分类号: G06F17/10 G06F17/30

    CPC分类号: G06F17/30498 G06F17/30592

    摘要: The embodiments of the invention provide a method of ordering an intersecting of a group of lists into a left-deep AND-tree. The method begins by performing a first selecting process including selecting a top list, corresponding to a top leaf of the left-deep AND-tree, from the group of lists to leave remaining lists of the group of lists. The top list can be the smallest list of the group of lists. The method can also select a pair of lists from the group of lists, such that the pair of lists has the smallest intersection size relative to other pairs of lists of the group of lists. Next, the method estimates intersections of the remaining lists with the top list by estimating an amount of intersection between the remaining lists and the top list. This involves sampling a portion of the remaining lists. The method also includes identifying larger list pairs having smaller intersections sizes when compared to smaller list pairs having larger intersections sizes.

    摘要翻译: 本发明的实施例提供了排序一组列表与左深AND树相交的方法。 该方法通过执行第一选择过程开始,包括从列表组中选择对应于左深AND树的顶叶的顶部列表,以留下列表组的剩余列表。 顶部列表可以是列表组中最小的列表。 该方法还可以从列表组中选择一对列表,使得该对列表相对于列表组的其他列表对具有最小的相交大小。 接下来,该方法通过估计剩余列表和顶部列表之间的交集量来估计剩余列表与顶部列表的交集。 这涉及对剩余列表的一部分进行抽样。 当与具有较大交叉点尺寸的较小列表对相比较时,该方法还包括识别具有较小交点尺寸的较大列表对。

    Query suggestions with high diversity
    3.
    发明授权
    Query suggestions with high diversity 有权
    具有高度多样性的查询建议

    公开(公告)号:US08631030B1

    公开(公告)日:2014-01-14

    申请号:US12979639

    申请日:2010-12-28

    IPC分类号: G06F17/30

    摘要: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for enhancing selecting relevant and diverse advertisements. In one aspect, a method includes receiving an initial query, selecting one or more additional queries relating to the initial query, including selecting a first additional query and a second diverse additional query, identifying one or more content items for each of the additional queries, the one or more content items forming a content block, and providing a content block and associated additional query to be displayed at a client device along with search results associated with the initial query.

    摘要翻译: 方法,系统和装置,包括在计算机存储介质上编码的计算机程序,用于增强选择相关和多样化的广告。 一方面,一种方法包括接收初始查询,选择与初始查询相关的一个或多个附加查询,包括选择第一附加查询和第二多样化附加查询,识别每个附加查询的一个或多个内容项, 形成内容块的一个或多个内容项,以及提供要在客户机设备上显示的内容块和相关联的附加查询以及与初始查询相关联的搜索结果。

    DISTRIBUTING CONTENT ITEMS
    4.
    发明申请
    DISTRIBUTING CONTENT ITEMS 审中-公开
    分配内容项目

    公开(公告)号:US20150248698A1

    公开(公告)日:2015-09-03

    申请号:US13006935

    申请日:2011-01-14

    IPC分类号: G06Q30/02 G06F17/30

    摘要: Information regarding display of selected content items in assigned slots is provided. The information is based on a selected template that includes areas for groups of slots for related content items, such as content items that are targeted to a common targeting object. Candidate content items, identified based on targeting or other distribution information, are assigned to selected slots to determine at least part of the information regarding display of the selected content items.

    摘要翻译: 提供关于在分配的时隙中显示所选内容项的信息。 该信息基于所选择的模板,该模板包括用于相关内容项目的时隙组的区域,诸如针对公共目标对象的内容项目。 基于目标或其他分发信息识别的候选内容项目被分配给所选择的时隙以确定关于所选内容项目的显示的信息的至少一部分。

    Advertisement allocation
    5.
    发明授权
    Advertisement allocation 有权
    广告分配

    公开(公告)号:US08620752B2

    公开(公告)日:2013-12-31

    申请号:US12605813

    申请日:2009-10-26

    IPC分类号: G06Q30/00

    CPC分类号: G06Q30/0276 G06Q30/02

    摘要: Systems and methods for allocating and providing advertisements in response to impression events (e.g., a request for a placement of an advertisement) corresponding to forecasted impressions (e.g., a forecast of a request for a placement of an advertisement). The advertisements are allocated according to solution data that includes two disjoint solution sets, with each solution set identifying an advertisement that can be allocated to a forecasted impression.

    摘要翻译: 响应于与预测的印象相对应的印象事件(例如,广告的放置请求)来分配和提供广告的系统和方法(例如,对广告的放置请求的预测)。 根据包含两个不相交解集的解的数据分配广告,每个解集合标识可以分配给预测印象的广告。

    Balancing content blocks associated with queries
    6.
    发明授权
    Balancing content blocks associated with queries 有权
    平衡与查询相关联的内容块

    公开(公告)号:US09152634B1

    公开(公告)日:2015-10-06

    申请号:US12980956

    申请日:2010-12-29

    IPC分类号: G06F17/30 G06F7/08

    摘要: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for enhancing selecting relevant and diverse advertisements. In one aspect, a method includes receiving an initial query, selecting one or more additional queries relating to the initial query, identifying one or more content items for each query, forming a content block, balancing each content block, and providing, for each query, a content block along with search results associated with the initial query for display or other processing by a device.

    摘要翻译: 方法,系统和装置,包括在计算机存储介质上编码的计算机程序,用于增强选择相关和多样化的广告。 一方面,一种方法包括接收初始查询,选择与初始查询相关的一个或多个附加查询,识别每个查询的一个或多个内容项,形成内容块,平衡每个内容块,以及为每个查询提供 ,内容块以及与初始查询相关联的搜索结果以进行显示或由设备进行的其他处理。

    Query suggestions with high utility
    7.
    发明授权
    Query suggestions with high utility 有权
    查询建议与高效用

    公开(公告)号:US08751520B1

    公开(公告)日:2014-06-10

    申请号:US12979575

    申请日:2010-12-28

    IPC分类号: G06F17/30

    CPC分类号: G06F17/3064

    摘要: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for enhancing selecting relevant and diverse advertisements. In one aspect, a method includes receiving an initial query, selecting one or more additional queries relating to the initial query, including selecting additional queries having a greatest utility, identifying one or more content items for each of the additional queries, the one or more content items forming a content block, and providing a content block and an associated additional query to a client device to be displayed along with search results associated with the initial query.

    摘要翻译: 方法,系统和装置,包括在计算机存储介质上编码的计算机程序,用于增强选择相关和多样化的广告。 在一个方面,一种方法包括接收初始查询,选择与初始查询相关的一个或多个附加查询,包括选择具有最大效用的附加查询,识别每个附加查询的一个或多个内容项,所述一个或多个 形成内容块的内容项,以及向与所述初始查询相关联的搜索结果一起显示的客户端设备提供内容块和相关联的附加查询。

    ADVERTISEMENT ALLOCATION
    8.
    发明申请
    ADVERTISEMENT ALLOCATION 有权
    广告分配

    公开(公告)号:US20100299215A1

    公开(公告)日:2010-11-25

    申请号:US12605813

    申请日:2009-10-26

    IPC分类号: G06Q30/00

    CPC分类号: G06Q30/0276 G06Q30/02

    摘要: Systems and methods for allocating and providing advertisements in response to impression events (e.g., a request for a placement of an advertisement) corresponding to forecasted impressions (e.g., a forecast of a request for a placement of an advertisement). The advertisements are allocated according to solution data that includes two disjoint solution sets, with each solution set identifying an advertisement that can be allocated to a forecasted impression.

    摘要翻译: 响应于与预测的印象相对应的印象事件(例如,广告的放置请求)来分配和提供广告的系统和方法(例如,对广告的放置请求的预测)。 根据包含两个不相交解集的解的数据分配广告,每个解集合标识可以分配给预测印象的广告。