5580 search results - page 852 / 1116 » Randomized priority algorithms |
134
click to vote
KDD
2004
ACM
16 years 3 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...
127
click to vote
STOC
2007
ACM
16 years 3 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....
115
click to vote
STOC
2003
ACM
16 years 3 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...
127
click to vote
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 ...
131
Voted
EDBT
2006
ACM
16 years 3 months ago
2006
ACM
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...