1046 search results - page 150 / 210 » Approximation Algorithms for Domination Search |
121
click to vote
ICML
2010
IEEE
15 years 4 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...
ENDM
2008
15 years 3 months ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
140
click to vote
JMLR
2010
14 years 10 months ago
2010
The goal of sufficient dimension reduction in supervised learning is to find the lowdimensional subspace of input features that is `sufficient' for predicting output values. ...
151
Voted
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
142
Voted
PODS
2007
ACM
16 years 3 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...