Brian P Larson

US Patent:

7814085, Oct 12, 2010

Filed:

Feb 26, 2004

Appl. No.:

10/787648

Inventors:

Karl Pfleger - Mountain View CA, US
Brian Larson - Mountain View CA, US

Assignee:

Google Inc. - Mountain View CA

International Classification:

G06F 7/00
G06F 17/30

US Classification:

707708, 707710, 707748, 707749, 707750

Abstract:

A system and method for scoring documents is described. One or more documents are identified responsive to a search criteria. A text match score indicating a quality of match of the identified documents is determined. A category match score is determined over categories. A document-categories score is determined indicating a quality of match between an identified document and a plurality of categories. A search criteria-categories score is determined indicating a quality of match between the search criteria and the categories. An overall score is determined based on the text match score and the category match score.

US Patent:

7925657, Apr 12, 2011

Filed:

Mar 17, 2004

Appl. No.:

10/802958

Inventors:

Karl Pfleger - Mountain View CA, US
Brian Larson - Mountain View CA, US

Assignee:

Google Inc. - Mountain View CA

International Classification:

G06F 7/00

US Classification:

707751

Abstract:

Methods and systems for adjusting a scoring measure of a search result based at least in part on the breadth of a previously-executed search query associated with the search result are described. In one described system, a search engine determines a popularity measure for a search result, and then adjusts the popularity measure based at least in part on a query breadth measure of a previously-executed search query associated with the search result. The search engine may use a variety of query breadth measures. For example, the search engine may use the quantity of results returned by the search query, the length of the query, the IR score drop-off, or some other measure of breadth.

US Patent:

8060517, Nov 15, 2011

Filed:

Apr 8, 2011

Appl. No.:

13/082732

Inventors:

Karl Robert Pfleger - San Francisco CA, US
Brian Larson - Mountain View CA, US

Assignee:

Google Inc. - Mountain View CA

International Classification:

G06F 7/00

US Classification:

707751

Abstract:

Methods and systems for adjusting a scoring measure of a search result based at least in part on the breadth of a previously-executed search query associated with the search result are described. In one described system, a search engine determines a popularity measure for a search result, and then adjusts the popularity measure based at least in part on a query breadth measure of a previously-executed search query associated with the search result. The search engine may use a variety of query breadth measures. For example, the search engine may use the quantity of results returned by the search query, the length of the query, the IR score drop-off, or some other measure of breadth.

US Patent:

8145618, Mar 27, 2012

Filed:

Oct 11, 2010

Appl. No.:

12/902075

Inventors:

Karl Pfleger - San Francisco CA, US
Brian Larson - Mountain View CA, US

Assignee:

Google Inc. - Mountain View CA

International Classification:

G06F 7/00
G06F 17/30

US Classification:

707708, 707710, 707748, 707749, 707750

Abstract:

A system and method for scoring documents is described. One or more documents are identified responsive to a search criteria. A text match score indicating a quality of match of the identified documents is determined. A category match score is determined over categories. A document-categories score is determined indicating a quality of match between an identified document and a plurality of categories. A search criteria-categories score is determined indicating a quality of match between the search criteria and the categories. An overall score is determined based on the text match score and the category match score.

US Patent:

20100082353, Apr 1, 2010

Filed:

Sep 29, 2008

Appl. No.:

12/240800

Inventors:

Brian D. Larson - East Palo Alto CA, US
Ricardo Cortes - Los Gatos CA, US
Aubrey Ness - San Francisco CA, US

Assignee:

Apple Inc. - Cupertino CA

International Classification:

G06Q 10/00

US Classification:

705 1

Abstract:

A system and method for allowing content providers to manage aspects of a distributor's digital workflow is disclosed. The system is effective to receive priority flags and associate the flags with items submitted by the content provider making the priority designation. Those items flagged for priority can be queued for priority processing. The total number of priority flags or requests can be limited by the rate at which items can be processed. The limited nature of the priority requests can make the priority flags valuable. The system and method can leverage that value to encourage desired conduct by awarding priority flags to content providers that comply with a stated policy.

US Patent:

20120059389, Mar 8, 2012

Filed:

Feb 22, 2010

Appl. No.:

13/202026

Inventors:

Loren Robert Larson - Fremont CA, US
Brian Lane Larson - Fremont CA, US
Peter Jacobson - Livermore CA, US
Paul Paspa - Los Gatos CA, US

International Classification:

A61N 1/378
A61B 19/00
A61N 1/36
A61N 1/05
A61N 1/365

US Classification:

606129, 607116, 607 37, 607 17, 607 65, 607 62, 607 32

Abstract:

Disclosed are various implantable medical devices adapted and configured to operation with a micro-generator comprising: an elongated housing; one or more longitudinally slidable elongated magnets; one or more coils positioned exteriorly, interiorly or integrally along at least a portion of the housing; a power wire in electrical communication with the one or more coils and with an implantable medical device; wherein the implantable micro-generator is adapted and configured to generate energy and communicate the generated energy to the implantable medical device. Additionally, methods of deploying and using the medical devices are contemplated, as well as systems, kits, and communication networks.

US Patent:

20220283883, Sep 8, 2022

Filed:

Jan 24, 2022

Appl. No.:

17/583121

Inventors:

- San Francisco CA, US
Siva Gurumurthy - San Francisco CA, US
Venumadhav Satuluri - San Francisco CA, US
Pankaj Gupta - San Francisco CA, US
Brian A. Larson - San Francisco CA, US
Aneesh Sharma - San Francisco CA, US
Ashish Goel - San Francisco CA, US

International Classification:

G06F 9/54
G06F 16/245
G06F 16/901
G06F 9/46

Abstract:

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.

US Patent:

20200349205, Nov 5, 2020

Filed:

May 18, 2020

Appl. No.:

16/877452

Inventors:

- San Francisco CA, US
Samuel Luckenbill - San Francisco CA, US
Brian Larson - San Francisco CA, US
Patrick J. Lok - San Francisco CA, US
Krishna Gade - San Francisco CA, US
Francesco G. Callari - San Francisco CA, US
Ugo Di Girolamo - San Francisco CA, US

International Classification:

G06F 16/951
G06F 16/903
G06F 16/2457
G06F 16/2455

Abstract:

A system for real-time search, including: a set of partitions, each including a set of segments, each segment corresponding to a time slice of messages posted to the messaging platform, and a real-time search engine configured to receive a search term in parallel with other partitions in set the set of partitions, and search at least one of the set of segments in reverse chronological order of the corresponding time slice to identify document identifiers of messages containing the search term; and a search fanout module configured to: receive a search query including the search term; send the search term to each of the set of partitions for parallel searching; and return, in response to the search query, at least one of the identified document identifiers of messages containing the search term.