Sciweavers

2638 search results - page 81 / 528
» Random Geometric Complexes
Sort
View
WSCG
2003
163views more  WSCG 2003»
15 years 5 months ago
Constructing Approximate Voronoi Diagrams from Digital Images of Generalized Polygons and Circular Objects
In this paper we present the geometrical construction of an approximate generalized Voronoi diagram for generalized polygons and circular objects based on their minimum geometrica...
W. L. Roque, D. Doering
APAL
2006
67views more  APAL 2006»
15 years 4 months ago
On partial randomness
If x = x1x2
Cristian S. Calude, Ludwig Staiger, Sebastiaan Ter...
COMPGEOM
2011
ACM
14 years 8 months ago
Minors in random and expanding hypergraphs
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
Uli Wagner
SPAA
2009
ACM
15 years 11 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
128
Voted
COCO
2007
Springer
108views Algorithms» more  COCO 2007»
15 years 10 months ago
The Communication Complexity of Correlation
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
Prahladh Harsha, Rahul Jain, David A. McAllester, ...