Patents by Inventor Oliver Sharp

Oliver Sharp has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20150161080
    Abstract: Techniques for identifying and viewing information items within an organization comprising a plurality of users each having one or more roles within the organization is disclosed. The disclosed techniques provide systems and methods for implementing and using a “skim preview” technique for previewing information items. This technique can be applied to a wide variety of information, such as presentations, documents, video, images, and so on and can be used for a variety of applications, including browsing, searching, discovery, and so on. The system can compute sequences that represent interesting visual aspects of the item being viewed. This can be applied to items that do not have a natural set of preview images, or it might be used as an alternative to the natural previews. The preview images may be sequenced chronologically, by importance, or based on any other metric.
    Type: Application
    Filed: December 10, 2014
    Publication date: June 11, 2015
    Inventors: Oliver Sharp, Robert Wahbe, David Wortendyke, Scot Gellock
  • Publication number: 20140280120
    Abstract: Techniques for organizing information, such as documents, presentations, web sites and web pages, audiovisual media streams, and the like are describe. This disclosed techniques include creating and using an interest graph to assist in a user's browsing of information. An interest graph expresses the affinity between people and information—the likelihood that a particular piece of information is of interest to a particular person. The interest graph is based on an understanding of relationships, monitoring of user behavior, and analysis of each piece of information. The interest graph represents many kinds of relationships, including: between users and other users, users and items, and users and collections. The interest graph can be computed using data both from a set of items and from user behavior.
    Type: Application
    Filed: March 14, 2014
    Publication date: September 18, 2014
    Applicant: Highspot, Inc.
    Inventors: Oliver Sharp, David Wortendyke, Scot Gellock, Robert Wahbe, Paul Viola
  • Publication number: 20140278816
    Abstract: Techniques for organizing information, such as documents, presentations, web sites and web pages, audiovisual media streams, and the like are describe. This disclosed techniques include creating and using an interest graph to support the sharing of information via search, browsing, and discovery, etc. and measuring consumption, engagement, and/or influence based on that information. An interest graph expresses the affinity between people and information—the likelihood that a particular piece of information is of interest to a particular person. The interest graph is based on an understanding of relationships, monitoring of user behavior, and analysis of each piece of information. The interest graph represents many kinds of relationships, including: between users and other users, users and items, and users and collections. The interest graph can be computed using data both from a set of items and from user behavior.
    Type: Application
    Filed: March 14, 2014
    Publication date: September 18, 2014
    Applicant: HIGHSPOT, INC.
    Inventors: Oliver Sharp, David Wortendyke, Scot Gellock, Robert Wahbe, Paul Viola
  • Publication number: 20140280121
    Abstract: Techniques for organizing information, such as documents, presentations, web sites and web pages, audiovisual media streams, and the like are describe. This disclosed techniques include creating and using an interest graph to support the distribution of information to a user via a feed containing information items likely to be of interest to the user. An interest graph expresses the affinity between people and information—the likelihood that a particular piece of information is of interest to a particular person. The interest graph is based on an understanding of relationships, monitoring of user behavior, and analysis of each piece of information. The interest graph represents many kinds of relationships, including: between users and other users, users and items, and users and collections. The interest graph can be computed using data both from a set of items and from user behavior.
    Type: Application
    Filed: March 14, 2014
    Publication date: September 18, 2014
    Applicant: HIGHSPOT, INC.
    Inventors: Oliver Sharp, David Wortendyke, Scot Gellock, Robert Wahbe, Paul Viola
  • Publication number: 20140181204
    Abstract: A method, which identifies information of interest within an organization, determines use data that characterizes relationships among information items within the organization, where the information items include user data and collections of information items. The method generates interest data indicating affinities among the information items based on the determined use data. After receiving a query for data regarding the information items, the method responds to the query by providing one or more results based on the generated interest data. More details are provided herein.
    Type: Application
    Filed: December 20, 2013
    Publication date: June 26, 2014
    Applicant: HIGHSPOT, INC.
    Inventors: Oliver Sharp, David Wortendyke, Scot Gellock, Robert Wahbe, Paul Viola
  • Patent number: 7739690
    Abstract: Abstracting communication with a plurality of containers. Each container encapsulates or hosts a module (e.g., a web service, a database, etc.) associated with a distributed application. A meta-container communicates with drivers that interface with each of the containers. The meta-container represents an abstraction and a virtualization of the containers in the hierarchy. Each container may also be a meta-container for other containers. The recursion and layered hierarchy provide flexible, extensible, and efficient management of the distributed application.
    Type: Grant
    Filed: April 26, 2007
    Date of Patent: June 15, 2010
    Assignee: Microsoft Corporation
    Inventors: Igor Sedukhin, Dan Eshner, Stephen T. Swartz, Oliver Sharp, Uday Kumar Bhaskara, Nagalinga Durga Prasad Sripathi Panditharadhya, Amol Sudhakar Kulkarni, Girish Mittur Venkataramanappa, Vladimir Pogrebinsky, Haoran Andy Wu
  • Publication number: 20080270585
    Abstract: Abstracting communication with a plurality of containers. Each container encapsulates or hosts a module (e.g., a web service, a database, etc.) associated with a distributed application. A meta-container communicates with drivers that interface with each of the containers. The meta-container represents an abstraction and a virtualization of the containers in the hierarchy. Each container may also be a meta-container for other containers. The recursion and layered hierarchy provide flexible, extensible, and efficient management of the distributed application.
    Type: Application
    Filed: April 26, 2007
    Publication date: October 30, 2008
    Applicant: MICROSOFT CORPORATION
    Inventors: Igor Sedukhin, Dan Eshner, Stephen T. Swartz, Oliver Sharp, Uday Kumar Bhaskara, Nagalinga Durga Prasad Sripathi Panditharadhya, Amol Sudhakar Kulkarni, Girish Mittur Venkataramanappa, Vladimir Pogrebinsky, Haoran Andy Wu