194 search results - page 5 / 39 » Computing Roundness is Easy if the Set is Almost Round |
COCO
2009
Springer
15 years 4 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
IPPS
2000
IEEE
15 years 1 months ago
2000
IEEE
In this paper, we propose a method which enables us to construct almost optimal broadcast schemes on an n-dimensional hypercube in the circuit switched, -port model. In this mode...
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
IEEEIAS
2009
IEEE
15 years 4 months ago
2009
IEEE
: An algorithm for one-way hash function construction based on conservative chaotic system is proposed. The plaintext is divided into a group of message blocks by a fixed length an...
SPAA
2010
ACM
14 years 9 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...