公开(公告)号：US09081808B1

公开(公告)日：2015-07-14

申请号：US14280428

申请日：2014-05-16

Applicant: Google Inc.

Inventor： Raimondas Kiveris

IPC: G06F15/16 ,  G06F17/30 ,  H04L29/08 ,  G06Q30/02

CPC classification number: G06F17/30312 ,  G06Q30/0241 ,  G06Q30/0251 ,  H04L67/306

Abstract: Methods, systems, and computer program products, including computer programs encoded on a computer readable storage medium, for pre-selecting content to be delivered to a user. A method includes: pre-selecting one or more content items for delivery to a user based at least in part on a user identifier, the user identifier identifying the user as being associated with a targeting group; storing the pre-selected content items in a list in association with the user; receiving a request for content, the request including the identifier; identifying one or more of the pre-selected content items eligible for delivery to the user based on the identifier; determining, based at least in part on evaluation criteria, that one of the pre-selected content items should be provided to the user responsive to the request; and providing, by a server system and responsive to the request, the determined content item to a client device.

Abstract translation: 方法，系统和计算机程序产品，包括在计算机可读存储介质上编码的计算机程序，用于预选择要传递给用户的内容。 一种方法包括：至少部分地基于用户标识符，预先选择用于递送给用户的一个或多个内容项目，所述用户标识符将用户识别为与目标组相关联; 将所述预先选择的内容项存储在与所述用户相关联的列表中; 接收对内容的请求，所述请求包括所述标识符; 基于所述标识符识别有资格传送给用户的一个或多个预先选择的内容项; 至少部分地基于评估标准来确定响应于该请求而向用户提供预选内容项中的一个; 以及通过服务器系统响应于所述请求将确定的内容项提供给客户端设备。

公开(公告)号：US20150006619A1

公开(公告)日：2015-01-01

申请号：US14143894

申请日：2013-12-30

Applicant: GOOGLE INC.

Inventor： Seyed Vahab Mirrokni Banadaki ,  Raimondas Kiveris ,  Vibhor Rastogi ,  Silvio Lattanzi ,  Sergei Vassilvitskii

IPC: H04L29/08

CPC classification number: H04L67/10 ,  G06F9/5066 ,  G06F9/546 ,  G06Q10/06

Abstract: Systems and methods for improving the time and cost to calculate connected components in a distributed graph are disclosed. One method includes reducing a quantity of map-reduce rounds used to determine a cluster assignment for a node in a large distributed graph by alternating between two hashing functions in the map stage of a map-reduce round and storing the cluster assignment for the node in a memory. Another method includes reducing a quantity of messages sent during map-reduce rounds by performing a predetermined quantity of rounds to generate, for each node, a set of potential cluster assignments, generating a data structure in memory to store a mapping between each node and its potential cluster assignment, and using the data structure during remaining map-reduce rounds, wherein the remaining map-reduce rounds do not send messages between nodes. The method can also include storing the cluster assignment for the node in a memory.

Abstract translation: 公开了用于改善计算分布图中的连接部件的时间和成本的系统和方法。 一种方法包括通过在map-reduce round的映射阶段中的两个散列函数之间交替并且将节点的集群分配存储在减少用于确定大分布式图中的节点的集群分配的地图缩小轮数量 一个记忆 另一种方法包括通过执行预定量的轮次来减少在地图缩小轮期间发送的消息的数量，以为每个节点生成一组潜在的分组分配，在存储器中生成数据结构以存储每个节点与其之间的映射 潜在的集群分配，以及在剩余的映射缩小循环期间使用数据结构，其中剩余的映射缩小轮不在节点之间发送消息。 该方法还可以包括将节点的集群分配存储在存储器中。

公开(公告)号：US20140143045A1

公开(公告)日：2014-05-22

申请号：US14163813

申请日：2014-01-24

Applicant: Google Inc.

Inventor： Raimondas Kiveris

IPC: G06Q30/02

CPC classification number: G06Q30/0246 ,  G06F16/23 ,  G06F16/9535 ,  G06Q30/0201 ,  G06Q30/0255

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for estimating segments from key values for advertising impressions.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于从用于广告印象的关键值估计段。

公开(公告)号：US09596295B2

公开(公告)日：2017-03-14

申请号：US14143894

申请日：2013-12-30

Applicant: GOOGLE INC.

Inventor： Seyed Vahab Mirrokni Banadaki ,  Raimondas Kiveris ,  Vibhor Rastogi ,  Silvio Lattanzi ,  Sergei Vassilvitskii

IPC: G06F17/00 ,  H04L29/08 ,  G06F9/50 ,  G06F9/54 ,  G06Q10/06

CPC classification number: H04L67/10 ,  G06F9/5066 ,  G06F9/546 ,  G06Q10/06

Abstract: Systems and methods for improving the time and cost to calculate connected components in a distributed graph are disclosed. One method includes reducing a quantity of map-reduce rounds used to determine a cluster assignment for a node in a large distributed graph by alternating between two hashing functions in the map stage of a map-reduce round and storing the cluster assignment for the node in a memory. Another method includes reducing a quantity of messages sent during map-reduce rounds by performing a predetermined quantity of rounds to generate, for each node, a set of potential cluster assignments, generating a data structure in memory to store a mapping between each node and its potential cluster assignment, and using the data structure during remaining map-reduce rounds, wherein the remaining map-reduce rounds do not send messages between nodes. The method can also include storing the cluster assignment for the node in a memory.

Abstract translation: 公开了用于改善计算分布图中的连接部件的时间和成本的系统和方法。 一种方法包括通过在map-reduce round的映射阶段中的两个散列函数之间交替并且将节点的集群分配存储在减少用于确定大分布式图中的节点的集群分配的地图缩小轮数量 一个记忆 另一种方法包括通过执行预定量的轮次来减少在地图缩小轮期间发送的消息的数量，以为每个节点生成一组潜在的分组分配，在存储器中生成数据结构以存储每个节点与其之间的映射 潜在的集群分配，以及在剩余的映射缩小循环期间使用数据结构，其中剩余的映射缩小轮不在节点之间发送消息。 该方法还可以包括将节点的集群分配存储在存储器中。

公开(公告)号：US08639575B2

公开(公告)日：2014-01-28

申请号：US13731560

申请日：2012-12-31

Applicant: Google Inc.

Inventor： Raimondas Kiveris

IPC: G06Q30/00

CPC classification number: G06Q30/0246 ,  G06F17/30345 ,  G06F17/30867 ,  G06Q30/0201 ,  G06Q30/0255

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for estimating segments from key values for advertising impressions.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于从用于广告印象的关键值估计段。