Netlogic Microsystems, Inc

Twitter, Inc.

Cypress Semiconductor Corporation

Verizon Media Inc.

Yahoo! Inc.

Oath Inc.

Pankaj Gupta

Srinivasan Venkatachary

Ashish Goel

Aneesh Sharma

Marshall Allen Beddoe

Bernardo De Seabra

Brian Hardie

Jason Endo

Giao Huu Phan

Ian Graeme Melven

Kam Ho Kenneth Cheung

Daniel Wei-Tze Hsiung

Dru Nelson

Joseph Gutierrez

Krishna Gade

Pradhuman Jhala

Rahul Ravindran

Yu-shuang Li

Sharon Paisner

Venumadhav Satuluri

Brian Larson

Ajeet Grewal

Volodymyr Zhabuik

Max Sadrieh

Vikas Unnava

Siva Gurumurthy

Dia Kharrat

Babak Ghassemi Hamadani

Timothy Trueman

Anand P Rangarajan

Liao Wei-Cherng

Mark Birman

Andrew Rosman

Srinivasan Venkalachary

Ashish Garg

A method for determining a circle of trust (CoT) includes receiving a request for the CoT, generating the CoT for the context account by: identifying a primary graph with nodes based on at least one action within a social network for the context account. The method further includes performing random walks through the nodes of the primary graph, each of the random walks including two steps, ranking each of the nodes based on an amount of the random walks that end on each of the nodes, with the CoT including a number of the highest ranking plurality of nodes, filtering content items using the CoT to identify a subset of relevant items, and providing the subset for display on a client device.

Method and system for implementing circle of trust in a social network

A method for distributed processing involves receiving a graph (G) of targets and of influencers, with each influencer related to at least one target, receiving an action graph of actions performed by one or more of the influencers, and key partitioning G across shards. The method further involves transposing the first graph (G) to obtain a first transposed graph (G), value partitioning Gacross the shards, storing the action graph on multiple shards, issuing, to a shard, a request specifying an influencer, to perform an intersection, receiving a response to the request of a set of influencers each of which is related to a target, and determining whether to send a recommendation to the target based on the response.

Distributed processing in a messaging platform

A distributed computing system is configured to compute operational data for a video advertisement delivery system. Cloud-based resource are used to calculate operational parameters such as geographical data, unique advertisement delivery instances and segments of consumers that received the video advertisements.

Geo, segment, uniques distributed computing system

A method and system for facilitating typeahead. The method can include: identifying a set of topics and/or connected accounts; storing, based on one or more signals associated with a user account, a portion of the topics and/or connected accounts in a cache; and using the cache to provide typeahead suggestions to a client in response to a request associated with the user account.

Typeahead using messages of a messaging platform

A method for distributed processing involves receiving a graph (G) of targets and of influencers, with each influencer related to at least one target, receiving an action graph of actions performed by one or more of the influencers, and key partitioning G across shards. The method further involves transposing the first graph (G) to obtain a first transposed graph (G), valuing partitioning Gacross the shards, storing the action graph on multiple shards, issuing, to a shard, a request specifying an influencer, to perform an intersection, receiving a response to the request of a set of influencers each of which is related to a target, and determining whether to send a recommendation to the target based on the response.

Method and system for distributed processing in a messaging platform

Techniques and systems for operating a video ad exchange includes controlling an ad server to receive ad requests from viewer devices, provide ad responses to viewer devices, generate an ad delivery data file that includes information about delivery of ads to the viewer devices, and transfer the ad delivery data file to a distributed computing cloud. The technique further includes controlling an ad data infrastructure mechanism to download the cloud-based ad delivery data file into a local memory, and process the copied ad delivery data file to generate billing data. An ad data infrastructure mechanism receives a configuration file from the ad server, verifies that all items in the configuration file from the ad server were used in the generation of the first billing data, and removes non-verifiable items from the first billing data to generate a final billing data.

Audited pipelined distributed system for video advertisement exchanges

A data stream search system can include a plurality of search data inputs logically divided into at least M+N sets. The sets have a logical order with respect to one another, each set providing more than one bit value. A key application circuit can comprise a plurality of data paths that each couple a different group of at least M data input sets to a corresponding content addressable memory (CAM) section. Each different group of at least M data input sets can be contiguous with respect to the logical order, and shifted in bit order from one another by at least two bits.

Pattern matching system and method for data streams, including deep packet inspection

A CAM system () can include a number of entries (-to-) having one portion for storing a data value (e.g., E) and another portion for storing a replicated data value (E(REP)). For on-the-fly error correction, the entries can be searched by applying an appended key value that includes a key portion (KEY) and replicated key portion (KEY(REP)).

Method for on-the-fly error correction in a content addressable memory(CAM) and device therefor

A method, apparatus, and storage medium product are provided for forming a forwarding database, and for using the formed database to more efficiently and quickly route packets of data across a computer network. The forwarding database is arranged into multiple sub-databases. Each sub-database is pointed to by a pointer within a pointer table. When performing a longest-match search of incoming addresses, a longest prefix matching algorithm can be used to find the longest match among specialized 'spear prefixes' stored in the pointer table. After the longest spear prefixes are found, the pointer table will direct the next search within a sub-database pointed to by that spear prefix. Another longest-match search can be performed for database prefixes (or simply 'prefixes') within the sub-database selected by the pointer. Only the sub-database of interest will, therefore, be searched and all other sub-databases are not accessed. Using a precursor pointer and a sub-database of optimally bounded size and number ensures power consumption be confined only to the sub-database being accessed, and that higher speed lookup operations can be achieved since only the sub-database of interest is being searched.

System and method for efficiently searching a forwarding database that is split into a bounded number of sub-databases having a bounded size

Growing community of inventors

Palo Alto, CA, United States of America

Pankaj Gupta