Sciweavers

70 search results - page 12 / 14
» Fast computation of low rank matrix
Sort
View
SPAA
1993
ACM
14 years 19 days ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
ICCV
2011
IEEE
12 years 8 months ago
The Generalized Trace-Norm and its Application to Structure-from-Motion Problems
In geometric computer vision, the structure from motion (SfM) problem can be formulated as a optimization problem with a rank constraint. It is well known that the trace norm of a...
Roland Angst, Christopher Zach, Marc Pollefeys
TWC
2008
109views more  TWC 2008»
13 years 8 months ago
Semi-Blind Adaptive Spatial Equalization for MIMO Systems with High-Order QAM Signalling
This contribution investigates semi-blind adaptive spatial filtering or equalisation for multiple-input multiple-output (MIMO) systems that employ high-throughput quadrature amplit...
Sheng Chen, Wang Yao, Lajos Hanzo
VLSID
2004
IEEE
147views VLSI» more  VLSID 2004»
14 years 9 months ago
Computing Silent Gate Models for Noise Analysis from Slew and Delay Tables
Abstract--In this paper, we present a new approach to calculate the steady state resistance values for CMOS library gates. These resistances are defined as simple equivalent models...
Shabbir H. Batterywala, Narendra V. Shenoy
CVPR
2007
IEEE
14 years 10 months ago
ShadowCuts: Photometric Stereo with Shadows
We present an algorithm for performing Lambertian photometric stereo in the presence of shadows. The algorithm has three novel features. First, a fast graph cuts based method is u...
Manmohan Krishna Chandraker, Sameer Agarwal, David...