Sciweavers

3192 search results - page 629 / 639
» The minimum latency problem
Sort
View
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
13 years 8 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
CONEXT
2009
ACM
13 years 8 months ago
EZ-Flow: removing turbulence in IEEE 802.11 wireless mesh networks without message passing
Recent analytical and experimental work demonstrate that IEEE 802.11-based wireless mesh networks are prone to turbulence. Manifestations of such turbulence take the form of large...
Adel Aziz, David Starobinski, Patrick Thiran, Alae...
ADHOC
2007
71views more  ADHOC 2007»
13 years 7 months ago
Service capacity in vehicular networks: A resource dissemination analysis
The support of peer-to-peer (P2P) resource sharing in dynamic scenarios is one of the most challenging research fields for both its expected commercial and technological impact o...
Laura Galluccio, Alessandro Leonardi, Antonio Mate...
COMGEO
2008
ACM
13 years 7 months ago
Optimal location of transportation devices
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
Jean Cardinal, Sébastien Collette, Ferran H...
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
The price of certainty: "waterslide curves" and the gap to capacity
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
Anant Sahai, Pulkit Grover