644 search results - page 45 / 129 » Decomposition Complexity |
113
Voted
ACSC
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
126
Voted
AAAI
2011
14 years 2 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
113
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
A scattering vector is a local descriptor including multiscale and multi-direction co-occurrence information. It is computed with a cascade of wavelet decompositions and complex m...
123
Voted
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
— Classically, the inverse kinematics is performed by computing the singular value decomposition of the matrix to invert. This enables a very simple writing of the algorithm. How...
119
Voted
JMLR
2010
14 years 9 months ago
2010
Networks are becoming a unifying framework for modeling complex systems and network inference problems are frequently encountered in many fields. Here, I develop and apply a gener...