2492 search results - page 318 / 499 » On the General Signature Trees |
287
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
We consider the problem of exploring the search tree of a CLP goal in pursuit of a target property. Essential to such a process is a method of tabling to prevent duplicate explorat...
187
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
178
click to vote
ICIAP
2001
Springer
16 years 6 months ago
2001
Springer
This paper describes a technique to represent relevant information of tree-like structures in a compact way. The technique is general. In the application described here, the image...
150
Voted
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
180
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...