895 search results - page 96 / 179 » Approximate convex decomposition |
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper an approach to reduce nonlinear non-observable and non-strongly accessible port-Hamiltonian systems to an observable and strongly accessible portHamiltonian syste...
ISCAS
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper, a modified version of the complex directional pyramid (PDTDFB) is proposed. Unlike the previous approach, the new FB provides an approximately tight-frame decom...
DMSN
2004
ACM
15 years 3 months ago
2004
ACM
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
119
click to vote
NIPS
2008
14 years 11 months ago
2008
The Singular Value Decomposition is a key operation in many machine learning methods. Its computational cost, however, makes it unscalable and impractical for applications involvi...
IJCV
2006
14 years 9 months ago
2006
: Linear subspace analysis (LSA) has become rather ubiquitous in a wide range of problems arising in pattern recognition and computer vision. The essence of these approaches is tha...