7006 search results - page 261 / 1402 » Approximation Algorithms |
170
click to vote
EDBT
2002
ACM
16 years 6 months ago
2002
ACM
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
152
click to vote
TACAS
2005
Springer
15 years 12 months ago
2005
Springer
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
146
click to vote
IJIT
2004
15 years 7 months ago
2004
Linear approximation of point spread function (PSF) is a new method for determining subpixel translations between images. The problem with the actual algorithm is the inability of ...
171
click to vote
CCCG
1998
15 years 7 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
230
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...