Sciweavers

112 search results - page 19 / 23
» Distributed anonymous discrete function computation
Sort
View
DCG
2010
171views more  DCG 2010»
13 years 6 months ago
Bregman Voronoi Diagrams
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...
Jean-Daniel Boissonnat, Frank Nielsen, Richard Noc...
WCNC
2008
IEEE
14 years 1 months ago
Fluid Model of the Outage Probability in Sectored Wireless Networks
— We establish a closed form formula of the other-cell interference factor f for omni-directional and sectored cellular networks, as a function of the location of the mobile. Tha...
Jean Marc Kelif, Marceau Coupechoux, Philippe Godl...
ICALP
2003
Springer
13 years 12 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
COMPGEOM
1987
ACM
13 years 10 months ago
Polygon Properties Calculated from the Vertex Neighborhoods
Calculating properties of polyhedra given only the set of the locations and neighborhoods of the vertices is easy. Possible properties include volume, surface area, and point cont...
Wm. Randolph Franklin
ICS
2010
Tsinghua U.
14 years 4 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz