Sciweavers

676 search results - page 99 / 136
» On Approximation Lower Bounds for TSP with Bounded Metrics
Sort
View
SODA
2010
ACM
177views Algorithms» more  SODA 2010»
14 years 6 months ago
On the Exact Space Complexity of Sketching and Streaming Small Norms
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
14 years 3 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
IWCMC
2009
ACM
14 years 3 months ago
Optimal cooperative spectrum sensing in cognitive sensor networks
This paper addresses the problem of optimal cooperative spectrum sensing in a cognitive-enabled sensor network where cognitive sensors can cooperate in the sensing of the spectrum...
Hai Ngoc Pham, Yan Zhang, Paal E. Engelstad, Tor S...
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
14 years 2 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
ICRA
2003
IEEE
108views Robotics» more  ICRA 2003»
14 years 2 months ago
PCG: a foothold selection algorithm for spider robot locomotion in 2D tunnels
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
Amir Shapiro, Elon Rimon