Sciweavers

697 search results - page 57 / 140
» On the Theory of Average Case Complexity
Sort
View
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
14 years 3 days ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
AAAI
2007
13 years 10 months ago
Biomind ArrayGenius and GeneGenius: Web Services Offering Microarray and SNP Data Analysis via Novel Machine Learning Methods
Analysis of postgenomic biological data (such as microarray and SNP data) is a subtle art and science, and the statistical methods most commonly utilized sometimes prove inadequat...
Ben Goertzel, Cassio Pennachin, Lúcio de So...
COLT
2008
Springer
13 years 9 months ago
An Efficient Reduction of Ranking to Classification
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
Nir Ailon, Mehryar Mohri
CORR
2000
Springer
116views Education» more  CORR 2000»
13 years 7 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
EUROGP
2009
Springer
132views Optimization» more  EUROGP 2009»
14 years 2 months ago
A Statistical Learning Perspective of Genetic Programming
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
Nur Merve Amil, Nicolas Bredeche, Christian Gagn&e...