451 search results - page 63 / 91 » Some Lower Bounds on Geometric Separability Problems |
PODS
1997
ACM
15 years 1 months ago
1997
ACM
We consider the problem of indexing general database workloads (combinations of data sets and sets of potential queries). We de ne a framework for measuring the eciency of an ind...
71
Voted
ICRA
1994
IEEE
15 years 1 months ago
1994
IEEE
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
63
Voted
ALGORITHMICA
2008
14 years 9 months ago
2008
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...
SIAMCO
2008
14 years 9 months ago
2008
We consider the class of nonlinear optimal control problems (OCP) with polynomial data, i.e., the differential equation, state and control constraints and cost are all described by...
MP
2007
14 years 9 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...