5115 search results - page 759 / 1023 » On Randomized Lanczos Algorithms |
180
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
Since the publication of Brin and Page's paper on PageRank, many in the Web community have depended on PageRank for the static (query-independent) ordering of Web pages. We s...
177
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
156
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
187
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
170
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....