85 search results - page 1 / 17 » Parametric search made practical |
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
EWC
2010
13 years 2 months ago
2010
Tensegrity structures are lightweight structures composed of cables in tension and struts in compression. Since tensegrity systems exhibit geometrically nonlinear behavior, findin...
SIBGRAPI
2008
IEEE
13 years 11 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
STOC
1999
ACM
13 years 9 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
POPL
1995
ACM
13 years 8 months ago
1995
ACM
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...