688 search results - page 93 / 138 » General Partitioning on Random Graphs |
122
Voted
TIT
2010
14 years 7 months ago
2010
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
110
click to vote
WSDM
2009
ACM
15 years 7 months ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
108
Voted
SIGIR
2006
ACM
15 years 6 months ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
113
click to vote
STOC
1996
ACM
15 years 4 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...