3341 search results - page 434 / 669 » On Bounded Queries and Approximation |
182
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
170
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
175
click to vote
3DIM
2005
IEEE
16 years 7 days ago
2005
IEEE
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...
173
click to vote
ICALP
2005
Springer
16 years 4 days ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
189
click to vote
WEBDB
2005
Springer
16 years 2 days ago
2005
Springer
Efficient querying XML documents is an increasingly important issue considering the fact that XML becomes the de facto standard for data representation and exchange over the Web,...