447 search results - page 35 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
132
Voted
IPSN
2009
Springer
15 years 10 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
89
Voted
ICRA
2009
IEEE
15 years 10 months ago
2009
IEEE
— This paper focuses on time-optimal path tracking, which involves planning of robot motions along prescribed geometric paths. Starting from a discretized convex reformulation of...
141
Voted
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
148
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
143
Voted
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...