3575 search results - page 163 / 715 » Structured motifs search |
168
click to vote
SISAP
2008
IEEE
16 years 29 days ago
2008
IEEE
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
233
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
169
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
Address geocoding, the process of finding the map location for a structured postal address, is a relatively well-studied problem. In this paper we consider the more general proble...
176
click to vote
ICIP
2000
IEEE
16 years 8 months ago
2000
IEEE
In this paper, we present a class of algorithms that use a partial distance metric to speedup the motion estimation process. The partial distance metric is used within the motion ...
151
click to vote
ERCIMDL
2003
Springer
15 years 11 months ago
2003
Springer
As many metadata are encoded in XML, and many digital libraries need to manage XML documents, efficient techniques for searching in such formatted data are required. In order to e...