Sciweavers

588 search results - page 14 / 118
» Computing the Dimension of Linear Subspaces
Sort
View
125
Voted
ETS
2006
IEEE
119views Hardware» more  ETS 2006»
15 years 9 months ago
On-Chip Test Generation Using Linear Subspaces
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...
Ramashis Das, Igor L. Markov, John P. Hayes
134
Voted
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
16 years 26 days ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
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...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
119
Voted
ICASSP
2009
IEEE
15 years 10 months ago
Higher dimensional consensus algorithms in sensor networks
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...
Usman A. Khan, Soummya Kar, José M. F. Mour...
124
Voted
CVPR
2008
IEEE
16 years 5 months ago
Dimensionality reduction using covariance operator inverse regression
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 ...
Minyoung Kim, Vladimir Pavlovic
133
Voted
FOCS
1990
IEEE
15 years 7 months ago
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
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...
Noga Alon, Nimrod Megiddo