340 search results - page 9 / 68 » Clustering with Lower Bound on Similarity |
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
101
click to vote
STOC
2012
ACM
12 years 12 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
175
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
We present theoretical bounds and empirical robustness of score regularization given changes in the similarity measure. Categories and Subject Descriptors: I.5.3 Clustering: Simil...