2084 search results - page 118 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
116
Voted
COMPGEOM
2009
ACM
15 years 7 months 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....
116
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a stream...
134
Voted
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
146
click to vote
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
113
Voted
COCO
1994
Springer
15 years 6 months ago
1994
Springer
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...