Sciweavers

7150 search results - page 987 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
ICML
2010
IEEE
15 years 8 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
SIGMOD
2010
ACM
154views Database» more  SIGMOD 2010»
15 years 7 months ago
Unbiased estimation of size and other aggregates over hidden web databases
Many websites provide restrictive form-like interfaces which allow users to execute search queries on the underlying hidden databases. In this paper, we consider the problem of es...
Arjun Dasgupta, Xin Jin, Bradley Jewell, Nan Zhang...
109
Voted
ICASSP
2010
IEEE
15 years 7 months ago
A novel estimation of feature-space MLLR for full-covariance models
In this paper we present a novel approach for estimating featurespace maximum likelihood linear regression (fMLLR) transforms for full-covariance Gaussian models by directly maxim...
Arnab Ghoshal, Daniel Povey, Mohit Agarwal, Pinar ...
ECIR
2010
Springer
15 years 7 months ago
Learning to Distribute Queries into Web Search Nodes
Web search engines are composed of a large set of search nodes and a broker machine that feeds them with queries. A location cache keeps minimal information in the broker to regist...
Marcelo Mendoza, Mauricio Marín, Flavio Fer...
HICSS
2008
IEEE
153views Biometrics» more  HICSS 2008»
15 years 7 months ago
Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
Doina Bein