Sciweavers

18 search results - page 3 / 4
» esa 2001
Sort
View
ESA
2001
Springer
110views Algorithms» more  ESA 2001»
13 years 9 months ago
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
Andrea E. F. Clementi, Angelo Monti, Riccardo Silv...
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
13 years 9 months ago
On the Parameterized Complexity of Layered Graph Drawing
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
13 years 9 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
ICVS
2001
Springer
13 years 9 months ago
A Stereo Vision System for Support of Planetary Surface Exploration
In this paper a system will be presented that was developed for ESA for the support of planetary exploration. The system that is sent to the planetary surface consists of a rover a...
Maarten Vergauwen, Marc Pollefeys, Luc J. Van Gool
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
13 years 6 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...