2638 search results - page 95 / 528 » Random Geometric Complexes |
135
click to vote
INFOCOM
2011
IEEE
14 years 8 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
166
Voted
COCO
2009
Springer
15 years 11 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
168
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
117
click to vote
ICIP
2005
IEEE
15 years 10 months ago
2005
IEEE
A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm avoids the multiple passes of bit-plane coding for speed impro...
SRDS
2006
IEEE
15 years 10 months ago
2006
IEEE
The paper presents a comparative performance study of the two main classes of randomized binary consensus protocols: a local coin protocol, with an expected high communication com...