60 search results - page 4 / 12 » Convex Relaxations for Subset Selection |
WIOPT
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
AAAI
2011
12 years 7 months ago
2011
In this paper, we propose a novel method to select the most informative subset of features, which has little redundancy and very strong discriminating power. Our proposed approach...
ESWS
2011
Springer
12 years 11 months ago
2011
Springer
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
Publication
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
We propose a convex optimization method for maximum likelihood estimation of autoregressive models, subject to conditional independence constraints. This problem is an extension t...