447 search results - page 39 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
200
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
300
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
165
click to vote
IDEAL
2005
Springer
15 years 11 months ago
2005
Springer
The elastic net and related algorithms, such as generative topographic mapping, are key methods for discretized dimension-reduction problems. At their heart are priors that specify...
128
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
184
click to vote
COMPGEOM
2005
ACM
15 years 7 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...