221 search results - page 16 / 45 » An Improved Approximation Algorithm for the Column Subset Se... |
107
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
115
click to vote
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
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...
111
Voted
ICML
2009
IEEE
15 years 9 months ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
154
Voted
FSTTCS
2003
Springer
15 years 7 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
116
Voted
ICDM
2009
IEEE
15 years 9 months ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...