Sciweavers

1930 search results - page 365 / 386
» Learning to Solve QBF
Sort
View
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
14 years 8 months ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
14 years 8 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett
SIGMOD
2009
ACM
168views Database» more  SIGMOD 2009»
14 years 8 months ago
Database research in computer games
This tutorial presents an overview of the data management issues faced by computer games today. While many games do not use databases directly, they still have to process large am...
Alan J. Demers, Johannes Gehrke, Christoph Koch, B...
ICFP
2008
ACM
14 years 7 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...
ICDE
2010
IEEE
263views Database» more  ICDE 2010»
14 years 7 months ago
Managing Uncertainty of XML Schema Matching
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...
Reynold Cheng, Jian Gong, David W. Cheung