Sciweavers

150 search results - page 16 / 30
» Traversing a set of points with a minimum number of turns
Sort
View
MOBIHOC
2006
ACM
14 years 7 months ago
Message ferry route design for sparse ad hoc networks with mobile nodes
Message ferrying is a networking paradigm where a special node, called a message ferry, facilitates the connectivity in a mobile ad hoc network where the nodes are sparsely deploy...
Muhammad Mukarram Bin Tariq, Mostafa H. Ammar, Ell...
ICALP
2005
Springer
14 years 1 months ago
The Generalized Deadlock Resolution Problem
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwa...
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
14 years 1 months ago
Communication-Aware Processor Allocation for Supercomputers
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
Michael A. Bender, David P. Bunde, Erik D. Demaine...
ESA
2008
Springer
137views Algorithms» more  ESA 2008»
13 years 9 months ago
An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
We present a new streaming algorithm for maintaining an -kernel of a point set in Rd using O((1/(d-1)/2 ) log(1/)) space. The space used by our algorithm is optimal up to a small ...
Hamid Zarrabi-Zadeh
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
14 years 4 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...