60 search results - page 2 / 12 » Convex Relaxations for Subset Selection |
103
click to vote
JMLR
2012
13 years 2 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
ICML
2007
IEEE
16 years 12 days ago
2007
IEEE
Although support vector machines (SVMs) for binary classification give rise to a decision rule that only relies on a subset of the training data points (support vectors), it will ...
IPSN
2005
Springer
15 years 5 months ago
2005
Springer
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
UAI
2008
15 years 1 months ago
2008
Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of me...
108
click to vote
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
ACT We consider the problem of sensor selection in resource constrained sensor networks. The fusion center selects a subset of k sensors from an available pool of m sensors accordi...