3406 search results - page 472 / 682 » General Search Algorithms for Energy Minimization Problems |
151
click to vote
ADBIS
2009
Springer
15 years 3 months ago
2009
Springer
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...
161
click to vote
ICCS
2009
Springer
15 years 3 months ago
2009
Springer
The Jaccard/Tanimoto coefficient is an important workload, used in a large variety of problems including drug design fingerprinting, clustering analysis, similarity web searching a...
174
click to vote
CLOUD
2010
ACM
15 years 10 months ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
164
click to vote
DAGM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We consider the classification problem on a finite set of objects. Some of them are labeled, and the task is to predict the labels of the remaining unlabeled ones. Such...
151
click to vote
JGO
2010
15 years 10 days ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...