5153 search results - page 767 / 1031 » Introduction to Randomized Algorithms |
116
click to vote
KDD
2007
ACM
16 years 4 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...
144
click to vote
KDD
2004
ACM
16 years 4 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...
137
click to vote
STOC
2007
ACM
16 years 4 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....
124
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
134
Voted
PODS
2006
ACM
16 years 3 months ago
2006
ACM
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...