Christopher K Conrad

US Patent:

20080281904, Nov 13, 2008

Filed:

May 11, 2007

Appl. No.:

11/801881

Inventors:

Christopher L. Conrad - Fremont CA, US
Christopher James Clarke - Milpitas CA, US
Michael K. Rudolph - Belmont CA, US

International Classification:

G06F 17/30
G06F 15/16
G06Q 10/00

US Classification:

709203, 705 8, 707 3, 707E17108

Abstract:

Embodiments of a service listing system for open source software projects are described. A plurality of available open source projects are stored in a centralized or distributed database system. Each open source project comprises one or more software programs. Third party support and maintenance services may be provided by third parties service providers. The service listing system associates one or more service listings from service providers with appropriate open source projects. The service listing includes contact information for the service provider, and a schedule of provided services and products, and fees, if applicable. Service listings can be associated with projects based on a specific identification of projects or a definition of categories or types of projects. The system includes an integrated search engine that allows project users to find services based on specific projects or specific services that are available. A rating and certification system allows users to rate service providers and provide feedback that can be used by other potential users of the service provider.

US Patent:

20130254213, Sep 26, 2013

Filed:

May 29, 2012

Appl. No.:

13/482884

Inventors:

Heyning Cheng - San Jose CA, US
Daniel Tunkelang - Mountain View CA, US
Bradley Scott Mauney - Mountain View CA, US
Ashley Woodman Hall - Menlo Park CA, US
Christopher Conrad - Fremont CA, US
Rui Wang - Sunnyvale CA, US
Yasuhiro Matsuda - Palo Alto CA, US

International Classification:

G06F 17/30

US Classification:

707748, 707E1703, 707E17044

Abstract:

Techniques for analyzing a social graph of a social network service to identify and then present connection paths connecting various entities are described. With some embodiments, subsequent to a user selecting or otherwise identifying two entities represented as nodes in a social graph, the social graph is analyzed to identify connection paths connecting the nodes representing the two entities. The social graph is implemented with a graph data structure having nodes and edges representing entities and associations between entities, respectively. With some embodiments, the nodes represent people, companies, educational institutions (e.g., schools, universities, etc.), and groups. After identifying the connection paths, the connection path or paths having the highest path scores, as derived by aggregating edge scores assigned to the edges, may be presented.

US Patent:

20130254305, Sep 26, 2013

Filed:

Jul 13, 2012

Appl. No.:

13/548957

Inventors:

Heyning Cheng - Los Gatos CA, US
Daniel Tunkelang - Mountain View CA, US
Bradley Scott Mauney - Mountain View CA, US
Ashley Woodman Hall - Menlo Park CA, US
Christopher Conrad - Fremont CA, US
Rui Wang - Sunnyvale CA, US
Yasuhiro Matsuda - Palo Alto CA, US

Assignee:

Linkedln Corporation - Mountain View CA

International Classification:

G06F 15/16

US Classification:

709206, 709204

Abstract:

Techniques for analyzing a social graph of a social network service to identify and then present connection paths connecting various entities are described. With some embodiments, subsequent to a user selecting or otherwise identifying two entities represented as nodes in a social graph, the social graph is analyzed to identify connection paths connecting the nodes representing the two entities. The social graph is implemented with a graph data structure having nodes and edges representing entities and associations between entities, respectively. With some embodiments, the nodes represent people, companies, educational institutions (e.g., schools, universities, etc.), and groups. After identifying the connection paths, the connection path or paths having the highest path scores, as derived by aggregating edge scores assigned to the edges, may be presented.