Sciweavers

4085 search results - page 719 / 817
» Benchmarking Data Mining Algorithms
Sort
View
124
Voted
NN
2008
Springer
152views Neural Networks» more  NN 2008»
15 years 2 months ago
Analysis of the IJCNN 2007 agnostic learning vs. prior knowledge challenge
We organized a challenge for IJCNN 2007 to assess the added value of prior domain knowledge in machine learning. Most commercial data mining programs accept data pre-formatted in ...
Isabelle Guyon, Amir Saffari, Gideon Dror, Gavin C...
126
Voted
IEEEPACT
2006
IEEE
15 years 8 months ago
An empirical evaluation of chains of recurrences for array dependence testing
Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instanc...
Johnnie Birch, Robert A. van Engelen, Kyle A. Gall...
AIPS
2010
15 years 2 months ago
The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem
We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Sc...
Malte Helmert, Hauke Lasinger
169
Voted
EDBT
2009
ACM
165views Database» more  EDBT 2009»
15 years 11 days ago
Exploiting the power of relational databases for efficient stream processing
Stream applications gained significant popularity over the last years that lead to the development of specialized stream engines. These systems are designed from scratch with a di...
Erietta Liarou, Romulo Goncalves, Stratos Idreos
206
Voted
POPL
2007
ACM
16 years 2 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi