Sciweavers

688 search results - page 132 / 138
» Computing with subspaces
Sort
View
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 7 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 7 months ago
Relative-Error CUR Matrix Decompositions
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
BMVC
2010
13 years 5 months ago
Person Re-Identification by Support Vector Ranking
Solving the person re-identification problem involves matching observations of individuals across disjoint camera views. The problem becomes particularly hard in a busy public sce...
Bryan Prosser, Wei-Shi Zheng, Shaogang Gong, Tao X...
ACCV
2010
Springer
13 years 2 months ago
Randomised Manifold Forests for Principal Angle-Based Face Recognition
Abstract. In set-based face recognition, each set of face images is often represented as a linear/nonlinear manifold and the Principal Angles (PA) or Kernel PAs are exploited to me...
Ujwal D. Bonde, Tae-Kyun Kim, K. R. Ramakrishnan
JCC
2011
133views more  JCC 2011»
13 years 2 months ago
MIBPB: A software package for electrostatic analysis
: The Poisson–Boltzmann equation (PBE) is an established model for the electrostatic analysis of biomolecules. The development of advanced computational techniques for the soluti...
Duan Chen, Zhan Chen, Changjun Chen, Weihua Geng, ...