Sciweavers

20 search results - page 2 / 4
» Stability and Generalization of Bipartite Ranking Algorithms
Sort
View
MOBICOM
2010
ACM
13 years 4 months ago
Exploiting temporal stability and low-rank structure for localization in mobile networks
Localization is a fundamental operation for many wireless networks. While GPS is widely used for location determination, it is unavailable in many environments either due to its h...
Swati Rallapalli, Lili Qiu, Yin Zhang, Yi-Chao Che...
SIGIR
2006
ACM
13 years 10 months ago
Respect my authority!: HITS without hyperlinks, utilizing cluster-based language models
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...
Oren Kurland, Lillian Lee
ML
2010
ACM
185views Machine Learning» more  ML 2010»
12 years 11 months ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal
ICDCS
2009
IEEE
14 years 1 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
CIKM
2008
Springer
13 years 6 months ago
Learning latent semantic relations from clickthrough data for query suggestion
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu