Abstract: Described is a system and method for customizing a user interface. A method according to one embodiment of the present invention comprises receiving a given content item and scoring the given content item. When the score exceeds a threshold, at least a portion of the given content is highlighted. The given content item is displayed with at least the portion of the given content item highlighted.

Abstract: The present invention is directed towards systems and methods for the classification or scoring of content items. The method according to one embodiment comprises providing at least one labeled content item as input to an initial classification model, a given labeled item having at least one feature, a given feature being associated with a weight, computing a posterior probability of the initial classification model for the given labeled content item and generating an updated classification model using the initial classification model and the weight associated with the given feature in the given labeled content item. The updated classification model is applied to an unlabeled content item to determine a score for the unlabeled content item.

Abstract: Content items are selected to be displayed on a portal page in such a way as to maximize a performance metric such as click-through rate. Problems relating to content selection are addressed, such as changing content pool, variable performance metric, and delay in receiving feedback on an item once the item has been displayed to a user. An adaptation of priority-based schemes for the multi-armed bandit problem, are used to project future trends of data. The adaptation introduces experiments concerning a future time period into the calculation, which increases the set of data on which to solve the multi-armed bandit problem. Also, a Bayesian explore/exploit method is formulated as an optimization problem that addresses all of the issues of content item selection for a portal page. This optimization problem is modified by Lagrange relaxation and normal approximation, which allow computation of the optimization problem in real time.

Abstract: Content items are selected to be displayed on a portal page in such a way as to maximize a performance metric such as click-through rate. Problems relating to content selection are addressed, such as changing content pool, variable performance metric, and delay in receiving feedback on an item once the item has been displayed to a user. An adaptation of priority-based schemes for the multi-armed bandit problem, are used to project future trends of data. The adaptation introduces experiments concerning a future time period into the calculation, which increases the set of data on which to solve the multi-armed bandit problem. Also, a Bayesian explore/exploit method is formulated as an optimization problem that addresses all of the issues of content item selection for a portal page. This optimization problem is modified by Lagrange relaxation and normal approximation, which allow computation of the optimization problem in real time.

Abstract: Content items are selected to be displayed on a portal page in such a way as to maximize a performance metric such as click-through rate. Problems relating to content selection are addressed, such as changing content pool, variable performance metric, and delay in receiving feedback on an item once the item has been displayed to a user. An adaptation of priority-based schemes for the multi-armed bandit problem are used to project future trends of data. The adaptation introduces experiments concerning a future time period into the calculation, which increases the set of data on which to solve the multi-armed bandit problem. Also, a Bayesian explore/exploit method is formulated as an optimization problem that addresses all of the issues of content item selection for a portal page. This optimization problem is modified by Lagrange relaxation and normal approximation, which allow computation of the optimization problem in real time.

Abstract: A method generates a document by: inserting one or more placeholders in the document; binding each placeholder to a content source; and compiling the placeholders into code to generate content for the document based on the content source. The method then executes the code to generate the content and presenting the content of the document if in a presentation mode or restores the placeholder if in an edit mode.

Abstract: Providing a search result in some embodiments comprises receiving a user query, determining whether an equivalent query of the user query is included in a pre-existing query set wherein the pre-existing query set is associated with an answer, and providing the answer. Providing a search result in some embodiments comprises receiving a user query, determining that an equivalent query of the user query is not included in any of a plurality of existing query sets, and adding the user query to one of the plurality of pre-existing query sets.

Abstract: Content items are selected to be displayed on a portal page in such a way as to maximize a performance metric such as click-through rate. Problems relating to content selection are addressed, such as changing content pool, variable performance metric, and delay in receiving feedback on an item once the item has been displayed to a user. An adaptation of priority-based schemes for the multi-armed bandit problem are used to project future trends of data. The adaptation introduces experiments concerning a future time period into the calculation, which increases the set of data on which to solve the multi-armed bandit problem. Also, a Bayesian explore/exploit method is formulated as an optimization problem that addresses all of the issues of content item selection for a portal page. This optimization problem is modified by Lagrange relaxation and normal approximation, which allow computation of the optimization problem in real time.

Abstract: Content items are selected to be displayed on a portal page in such a way as to maximize a performance metric such as click-through rate. Problems relating to content selection are addressed, such as changing content pool, variable performance metric, and delay in receiving feedback on an item once the item has been displayed to a user. An adaptation of priority-based schemes for the multi-armed bandit problem are used to project future trends of data. The adaptation introduces experiments concerning a future time period into the calculation, which increases the set of data on which to solve the multi-armed bandit problem. Also, a Bayesian explore/exploit method is formulated as an optimization problem that addresses all of the issues of content item selection for a portal page. This optimization problem is modified by Lagrange relaxation and normal approximation, which allow computation of the optimization problem in real time.

Abstract: Described is a system and method for customizing a user interface. A method according to one embodiment of the present invention comprises receiving a given content item and scoring the given content item. When the score exceeds a threshold, at least a portion of the given content is highlighted. The given content item is displayed with at least the portion of the given content item highlighted.

Abstract: A method of providing relevant search information comprises receiving a search term. The method also comprises locating a first search result that matches the search term, wherein the first search result is associated with a first measure of reputation, locating a second search result that matches the search term, wherein the second search result is associated with a second measure of reputation, and preferentially presenting the first and the second search results based on the first and the second measures of reputation.

Abstract: The present invention is directed towards systems and methods for the classification or scoring of content items. The method according to one embodiment comprises providing at least one labeled content item as input to an initial classification model, a given labeled item having at least one feature, a given feature being associated with a weight, computing a posterior probability of the initial classification model for the given labeled content item and generating an updated classification model using the initial classification model and the weight associated with the given feature in the given labeled content item. The updated classification model is applied to an unlabeled content item to determine a score for the unlabeled content item.

Abstract: A translator for translating server-side instructions includes a set of rules for translating server-side instructions from a first grammar to a second different grammar and a translation engine, such as an extensible style-sheet language translator (XSLT), for translating the server-side instructions based on the set of rules.

Abstract: A translator for translating server-side instructions includes a set of rules for translating server-side instructions from a first grammar to a second different grammar and a translation engine, such as an extensible style-sheet language translator (XSLT), for translating the server-side instructions based on the set of rules.

Abstract: A method generates a document by: inserting one or more placeholders in the document; binding each placeholder to a content source; and compiling the placeholders into code to generate content for the document based on the content source. The method then executes the code to generate the content and presenting the content of the document if in a presentation mode or restores the placeholder if in an edit mode.

Abstract: A method and apparatus for reducing network latency during execution of a multiple-player game across a computer network are provided. A master database represents a world model for the game, and a master event server sequences user inputs, or events, for updating the master database. The master event server and the master database are initially located on a particular node in the network. Every other node that is used by a player in the game has a slave event server and a slave database. Slave event servers are responsible for updating their local slave database, sending events from their local node to the master event server, and forwarding events to and from other slave servers. In the method, a determination is made of which player in the game has a role in the game requiring the least latency of any role and which node in the network is being used by that player.