Sciweavers

602 search results - page 116 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
PODS
2004
ACM
148views Database» more  PODS 2004»
14 years 10 months ago
Deterministic Wavelet Thresholding for Maximum-Error Metrics
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
Minos N. Garofalakis, Amit Kumar
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 2 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
RECOMB
2004
Springer
14 years 10 months ago
Computational identification of evolutionarily conserved exons
Phylogenetic hidden Markov models (phylo-HMMs) have recently been proposed as a means for addressing a multispecies version of the ab initio gene prediction problem. These models ...
Adam C. Siepel, David Haussler
KDD
2000
ACM
129views Data Mining» more  KDD 2000»
14 years 1 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
WWW
2009
ACM
14 years 10 months ago
Combining global optimization with local selection for efficient QoS-aware service composition
The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web servi...
Mohammad Alrifai, Thomas Risse