Sciweavers

1046 search results - page 108 / 210
» Approximation Algorithms for Domination Search
Sort
View
JAIR
2008
103views more  JAIR 2008»
15 years 3 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
15 years 25 days ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
KDD
2000
ACM
129views Data Mining» more  KDD 2000»
15 years 6 months ago
Evolutionary algorithms in data mining: multi-objective performance modeling for direct marketing
Predictive models in direct marketing seek to identify individuals most likely to respond to promotional solicitations or other intervention programs. While standard modeling appr...
Siddhartha Bhattacharyya
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 5 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
NPL
2000
95views more  NPL 2000»
15 years 2 months ago
Bayesian Sampling and Ensemble Learning in Generative Topographic Mapping
Generative topographic mapping (GTM) is a statistical model to extract a hidden smooth manifold from data, like the self-organizing map (SOM). Although a deterministic search algo...
Akio Utsugi