377 search results - page 31 / 76 » Distributed spatio-temporal similarity search |
171
click to vote
SPIESR
1997
15 years 7 months ago
1997
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...
157
click to vote
AIPS
2000
15 years 7 months ago
2000
The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper...
387
click to vote
ICDE
2000
IEEE
16 years 7 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
168
click to vote
ICCS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
144
click to vote
SIGIR
2004
ACM
15 years 11 months ago
2004
ACM
: We consider the problem of collaborative Web search and query routing strategies in a peer-to-peer (P2P) environment. In our architecture every peer has a full-fledged search en...