588 search results - page 14 / 118 » Computing the Dimension of Linear Subspaces |
ETS
2006
IEEE
15 years 5 months ago
2006
IEEE
A central problem in built-in self test (BIST) is how to efficiently generate a small set of test vectors that detect all targeted faults. We propose a novel solution that uses l...
100
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
ICASSP
2009
IEEE
15 years 6 months ago
2009
IEEE
This paper introduces higher dimensional consensus, a framework to capture a number of different, but, related distributed, iterative, linear algorithms of interest in sensor netw...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the task of dimensionality reduction for regression (DRR) whose goal is to find a low dimensional representation of input covariates, while preserving the statistical ...
FOCS
1990
IEEE
15 years 3 months ago
1990
IEEE
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...