Sciweavers

5595 search results - page 910 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ICML
2010
IEEE
15 years 7 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 6 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...
CORR
2010
Springer
138views Education» more  CORR 2010»
15 years 6 months ago
On building minimal automaton for subset matching queries
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
Kimmo Fredriksson
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 6 months ago
Distributed anonymous discrete function computation
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
Julien M. Hendrickx, Alexander Olshevsky, John N. ...
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 6 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan