Sciweavers

3514 search results - page 23 / 703
» A search space
Sort
View
SIAMJO
2008
112views more  SIAMJO 2008»
13 years 8 months ago
Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern Search for constrained n...
Charles Audet, J. E. Dennis, Sébastien Le D...
TODS
2002
92views more  TODS 2002»
13 years 8 months ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella
VLDB
1997
ACM
170views Database» more  VLDB 1997»
14 years 11 days ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula
CPM
2004
Springer
86views Combinatorics» more  CPM 2004»
14 years 2 months ago
Optimizing Multiple Spaced Seeds for Homology Search
Optimized spaced seeds improve sensitivity and specificity in local homology search. Several authors have shown that multiple seeds can have better sensitivity and specificity t...
Jinbo Xu, Daniel G. Brown, Ming Li, Bin Ma
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
14 years 1 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani