328 search results - page 44 / 66 » An O(log n log log n) space algorithm for undirected st-conn... |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
COMPGEOM
2009
ACM
14 years 7 days ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
CPM
2004
Springer
13 years 11 months ago
2004
Springer
The problem of comparing two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence...
SWAT
2010
Springer
14 years 18 days ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...