60 search results - page 9 / 12 » Convex Relaxations for Subset Selection |
COR
2008
13 years 7 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...
VLSID
2007
IEEE
14 years 7 months ago
2007
IEEE
Performance of an application can be improved through augmenting the processor with Application specific Functional Units (AFUs). Usually a cluster of operations identified from th...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Learning object categories from small samples is a challenging problem, where machine learning tools can in general provide very few guarantees. Exploiting prior knowledge may be ...
ALGORITHMICA
2010
13 years 7 months ago
2010
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...