2252 search results - page 95 / 451 » Lower Bounds for Dynamic Algorithms |
SIGMOD
2003
ACM
16 years 1 months ago
2003
ACM
Digital content is for copying: quotation, revision, plagiarism, and file sharing all create copies. Document fingerprinting is concerned with accurately identifying copying, incl...
134
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
114
click to vote
NIPS
1998
15 years 2 months ago
1998
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
115
Voted
ALGORITHMICA
2005
15 years 1 months ago
2005
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
101
click to vote
DCC
2000
IEEE
15 years 1 months ago
2000
IEEE
Due to the success of differential and linear attacks on a large number of encryption algorithms, it is importanttoinvestigaterelationshipsamongvariouscryptographic, includingdiffe...