1632 search results - page 214 / 327 » Sublinear Time Algorithms for Metric Space Problems |
140
click to vote
ICCVW
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Popular algorithms for feature matching and model extraction fall into two broad categories, generate-and-test and Hough transform variations. However, both methods su er...
152
Voted
SIGIR
2005
ACM
15 years 9 months ago
2005
ACM
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
108
click to vote
DAC
2005
ACM
16 years 5 months ago
2005
ACM
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective ...
130
Voted
ISRR
2001
Springer
15 years 8 months ago
2001
Springer
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
135
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whethe...