60 search results - page 7 / 12 » Convex Relaxations for Subset Selection |
PSD
2010
Springer
13 years 5 months ago
2010
Springer
Minimum-distance controlled tabular adjustment methods (CTA), and its restricted variants (RCTA), is a recent perturbative approach for tabular data protection. Given a table to be...
AUTOMATICA
2007
13 years 7 months ago
2007
ust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x,...
TASE
2008
IEEE
13 years 7 months ago
2008
IEEE
We address the sensor selection problem which arises in tracking and localization applications. In sensor selection, the goal is to select a small number of sensors whose measureme...
CVPR
2012
IEEE
11 years 9 months ago
2012
IEEE
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. We assume that each data poi...
BMCBI
2005
13 years 7 months ago
2005
Background: Recent studies have shown that the patterns of linkage disequilibrium observed in human populations have a block-like structure, and a small subset of SNPs (called tag...