76 search results - page 13 / 16 » On the Complexity of Matrix Rank and Rigidity |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
UAI
1996
13 years 8 months ago
1996
We extend the Bayesian Information Criterion (BIC), an asymptotic approximation for the marginal likelihood, to Bayesian networks with hidden variables. This approximation can be ...
TSP
2010
13 years 2 months ago
2010
Abstract--In this paper, the problem of estimating direction-ofarrival (DOA) of multiple uncorrelated sources from single antenna power measurements is addressed. Utilizing the fac...
CDC
2010
IEEE
12 years 11 months ago
2010
IEEE
— This paper investigates measures of centrality that are applicable to power grids. Centrality measures are used in network science to rank the relative importance of nodes and ...