Microsoft Technology Licensing, LLC

Robert David Berg

Vivek Garg

Christopher Jay Hoorn

Erica L Klein

Thomas F Bergstraesser

Jamie R Cabaccang

Sandeep Suresh

Evan Ming Lew

Bert Casper

Scheduling one or more users via potential calendars is presented. In preparing a potential schedule request, one or more potential time slots in which the to-be scheduled event may be held are identified. The potential schedule is sent to the scheduled users and the potential time slots for the potential schedule event are added to the users' calendars. In response to clarifying information, one or more potential time slots of the potential schedule request may be removed from consideration for the potential schedule event. A selection is made regarding a potential time slot for the potential schedule event and the potential schedule event is promoted to the explicit calendars of the scheduled users to be held at the selected potential time slot. In promoting the potential schedule event to the explicit calendars, the potential event is removed from the potential calendars, including any remaining potential time slots.

Scheduling using potential calendars

Systems and methods for creating a calendar event on a calendar are presented. In response to a request to create a calendar event on a calendar, a first set of calendar event suggestions are presented to a user on a computing device. In response to a selection of a calendar event suggestion, an attribute corresponding to the selected calendar event suggestion is added to an attribute set. A subsequent set of calendar event suggestions are then presented on the computing device. In response to a selection of a subsequent calendar event suggestion, an attribute corresponding to the subsequent calendar event suggestion is added to an attribute set. A calendar event is created on the calendar according to the attributes in the attribute set in response to an instruction to create the calendar event.

Efficient calendar creation

Methods, systems, algorithms, and media are provided for query classification based upon web relevance. In embodiments, a knowledge domain is selected. A knowledge domain includes a set of seed-web domains which are classified to belong to the knowledge domain. For each seed-web domain, a filtered web search of a given query is implemented utilizing a filter associated with a particular seed-web domain to obtain a total number of filtered results for the seed-web domain. For each seed-web domain, a total number of non-filtered results are referenced. A percentage of coverage for each seed-web domain is calculated using the total number of filtered results for the seed-web domain and the total number of non-filtered results for the seed-web domain. An average percentage of coverage for the knowledge domain is calculated using the percentage of coverage for each seed-web domain.

Web-relevance based query classification

A query may be ambiguous when the domain-confidence factors indicate a high likelihood that the search query may belong to two or more domains. A domain is a subject matter category such as shopping, sports, entertainment, music, or politics. A domain-confidence factor indicates the likelihood that a search query is related to a particular domain. Upon determining that a search query is ambiguous, embodiments of the present invention may present an interface that allows the user to place the search query into one or more domains. Updated search results, or other objects, may be returned based on the selection of a domain by the user.

Growing community of inventors

Monroe, WA, United States of America

Robert David Berg