76 search results - page 14 / 16 » Lower bounds for adaptive linearity tests |
ICLP
1997
Springer
13 years 11 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
CAD
2000
Springer
13 years 7 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
SIAMSC
2010
13 years 6 months ago
2010
For the finite volume discretization of a second-order elliptic model problem, we derive a posteriori error estimates which take into account an inexact solution of the associated...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...