Sciweavers

588 search results - page 52 / 118
» Computing the Dimension of Linear Subspaces
Sort
View
ICALP
2007
Springer
14 years 4 months ago
Holographic Algorithms: The Power of Dimensionality Resolved
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimens...
Jin-yi Cai, Pinyan Lu
CORR
2008
Springer
119views Education» more  CORR 2008»
13 years 10 months ago
Self-stabilizing Numerical Iterative Computation
Many challenging tasks in sensor networks, including sensor calibration, ranking of nodes, monitoring, event region detection, collaborative filtering, collaborative signal proces...
Ezra N. Hoch, Danny Bickson, Danny Dolev
ICPR
2000
IEEE
14 years 11 months ago
Sign of Gaussian Curvature from Eigen Plane Using Principal Components Analysis
This paper describes a new method to recover the sign of the local Gaussian curvature at each point on the visible surface of a 3-D object. Multiple (p > 3) shaded images are a...
Shinji Fukui, Yuji Iwahori, Akira Iwata, Robert J....
CDC
2009
IEEE
14 years 2 months ago
Schur-based decomposition for reachability analysis of linear time-invariant systems
— We present a method for complexity reduction in reachability analysis and controller synthesis via a Schur-based decomposition for LTI systems. The decomposition yields either ...
Shahab Kaynama, Meeko Oishi
ICPR
2008
IEEE
14 years 4 months ago
Face recognition based on LBP and orthogonal rank-one tensor projections
In this paper, a novel framework for face recognition based on discriminatively trained orthogonal rank-one tensor projections (ORO) and local binary pattern (LBP) is proposed. LB...
NuTao Tan, Lei Huang, Changping Liu