Sciweavers

4372 search results - page 365 / 875
» Algorithmic Theories of Everything
Sort
View
ICML
2007
IEEE
16 years 7 months ago
Spectral feature selection for supervised and unsupervised learning
Feature selection aims to reduce dimensionality for building comprehensible learning models with good generalization performance. Feature selection algorithms are largely studied ...
Zheng Zhao, Huan Liu
ICML
2008
IEEE
16 years 7 months ago
Query-level stability and generalization in learning to rank
This paper is concerned with the generalization ability of learning to rank algorithms for information retrieval (IR). We point out that the key for addressing the learning proble...
Yanyan Lan, Tie-Yan Liu, Tao Qin, Zhiming Ma, Hang...
ICML
2006
IEEE
16 years 7 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan
SIGSOFT
2007
ACM
16 years 7 months ago
The impact of input domain reduction on search-based test data generation
There has recently been a great deal of interest in search? based test data generation, with many local and global search algorithms being proposed. However, to date, there has be...
Mark Harman, Youssef Hassoun, Kiran Lakhotia, Phil...
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 7 months ago
A constant-factor approximation for stochastic Steiner forest
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
Anupam Gupta, Amit Kumar