Yahoo!

About: Yahoo! is a company organization based out in London, United Kingdom. It is known for research contribution in the topics: Population & Web search query. The organization has 26749 authors who have published 29915 publications receiving 732583 citations. The organization is also known as: Yahoo! Inc. & Maudwen-Yahoo! Inc.

A system and method for creating a playlist

Abstract: A method, system, and user interface for creating a personalized and customizable playlist. In one embodiment, the method and system for generating a playlist includes the user selecting and/or entering media file identifiers associated with media files and then initiating automatic playlist generation.

Discovering query intent from search queries and concept networks

Abstract: A system is described for discovering query intent based on search queries and concept networks. The system may construct frequency vectors from log data corresponding to a submitted query and at least one related query submitted to one or more search engines. The system may also construct a query intent vector based on the frequency vectors. The query intent vector may include frequency scores that represent the intent of the query.

An almost optimal unrestricted fast Johnson-Lindenstrauss transform

Abstract: The problems of random projections and sparse reconstruction have much in common and individually received much attention. Surprisingly, until now they progressed in parallel and remained mostly separate. Here, we employ new tools from probability in Banach spaces that were successfully used in the context of sparse reconstruction to advance on an open problem in random pojection. In particular, we generalize and use an intricate result by Rudelson and Veshynin [2008] for sparse reconstruction which uses Dudley’s theorem for bounding Gaussian processes. Our main result states that any set of N = exp(O(n)) real vectors in n dimensional space can be linearly mapped to a space of dimension k = O(log N polylog(n)), while (1) preserving the pairwise distances among the vectors to within any constant distortion and (2) being able to apply the transformation in time O(n log n) on each vector. This improves on the best known bound N = exp(O(n1/2)) achieved by Ailon and Liberty [2009] and N = exp(O(n1/3)) by Ailon and Chazelle [2010]. The dependence in the distortion constant however is suboptimal, and since the publication of an early version of the work, the gap between upper and lower bounds has been considerably tightened obtained by Krahmer and Ward [2011]. For constant distortion, this settles the open question posed by these authors up to a polylog(n) factor while considerably simplifying their constructions.

Federation and interoperability between social networks

Abstract: Communications between social networks are enabled via authentication that provides single-sign-on (SSO) authentication of users such as individual users or social networks or social network services that desire access to network resources on a particular social network. The particular network requests authentication of the requesting user(s), and based on an authentication result the particular network provides or denies access to the resources. A social network services database maintains a listing of resources of different social networks, that a user can search to determine where to find resources on other networks. The user can then query the social networks hosting those resources or their social network services for access, and the networks or services can authenticate the user before granting access according to any conditions that the hosting social networks or social network services may choose to apply.

Composing a message in an online textbox using a non-latin script

Abstract: A method and an apparatus are provided for composing a message in an online textbox using a non-Latin script. In one example, the method includes receiving a selection of a target language for composing the message in the online textbox, loading a hash table and an integer n that are associated with the target language, adding to a queue a character inputted from a QWERTY keyboard, and applying appropriate parsing and mapping techniques to the queue using the hash table and the integer n to display an appropriate script of the target language.