Sciweavers

8746 search results - page 239 / 1750
» Diversifying search results
Sort
View
140
Voted
ACST
2006
15 years 2 months ago
An efficient search algorithm for partially ordered sets
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
Yan Chen
DATESO
2004
81views Database» more  DATESO 2004»
15 years 2 months ago
Pivoting M-tree: A Metric Access Method for Efficient Similarity Search
In this paper pivoting M-tree (PM-tree) is introduced, a metric access method combining M-tree with the pivot-based approach. While in M-tree a metric region is represented by a hy...
Tomás Skopal
95
Voted
IJCAI
2001
15 years 2 months ago
Local Search Topology in Planning Benchmarks: An Empirical Analysis
Many state-of-the-art heuristic planners derive their heuristic function by relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. ...
Jörg Hoffmann
89
Voted
FUIN
2006
81views more  FUIN 2006»
15 years 23 days ago
Indexing Schemes for Similarity Search: an Illustrated Paradigm
We suggest a variation of the Hellerstein-Koutsoupias--Papadimitriou indexability model for datasets equipped with a similarity measure, with the aim of better understanding the s...
Vladimir Pestov, Aleksandar Stojmirovic
97
Voted
IS
2006
15 years 23 days ago
High dimensional nearest neighbor searching
As databases increasingly integrate different types of information such as time-series, multimedia and scientific data, it becomes necessary to support efficient retrieval of mult...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...