1632 search results - page 187 / 327 » Sublinear Time Algorithms for Metric Space Problems |
161
click to vote
IWOCA
2010
Springer
14 years 11 months ago
2010
Springer
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
124
click to vote
AAAI
1998
15 years 5 months ago
1998
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
127
click to vote
SMI
2005
IEEE
15 years 10 months ago
2005
IEEE
For time-dependent scalar fields, one is often interested in topology changes of contours in time. In this paper, we focus on describing how contours split and merge over a certa...
147
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
146
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...