Sciweavers

3208 search results - page 397 / 642
» A Lower Bound for Primality
Sort
View
SODA
2008
ACM
70views Algorithms» more  SODA 2008»
15 years 8 months ago
Optimal universal graphs with deterministic embedding
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
Noga Alon, Michael R. Capalbo
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
15 years 8 months ago
Earth mover distance over high-dimensional spaces
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
Alexandr Andoni, Piotr Indyk, Robert Krauthgamer
OPODIS
2007
15 years 8 months ago
Deterministic Communication in the Weak Sensor Model
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...
Antonio Fernández Anta, Miguel A. Mosteiro,...
OPODIS
2007
15 years 8 months ago
Timed Quorum Systems for Large-Scale and Dynamic Environments
This paper presents Timed Quorum System (TQS), a quorum system for large-scale and dynamic systems. TQS provides guarantees that two quorums, accessed at instances of time that are...
Vincent Gramoli, Michel Raynal
RSS
2007
115views Robotics» more  RSS 2007»
15 years 8 months ago
An experimental study of exploiting multipath fading for robot communications
— A simple approach for mobile robots to exploit multipath fading in order to improve received radio signal strength (RSS), is presented. The strategy is to sample the RSS at dis...
Magnus Lindhé, Karl Henrik Johansson, Anton...