217 search results - page 4 / 44 » On the Fine Structure of Large Search Spaces |
177
click to vote
ICDE
1998
IEEE
15 years 10 months ago
1998
IEEE
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
JMLR
2010
14 years 4 months ago
2010
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
VLDB
1993
ACM
15 years 1 months ago
1993
ACM
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
PPL
2010
14 years 4 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
IPMI
2009
Springer
15 years 10 months ago
2009
Springer
Recently, marginal space learning (MSL) was proposed as a generic approach for automatic detection of 3D anatomical structures in many medical imaging modalities [1]. To accurately...