Sciweavers

42 search results - page 6 / 9
» Schreier decomposition of loops
Sort
View
ICRA
2008
IEEE
158views Robotics» more  ICRA 2008»
14 years 1 months ago
Inverse Kinematics without matrix inversion
– This paper presents a new singularity robust and computationally efficient method for solving the inverse kinematics (IK) problem. In this method, the transformation from Carte...
Alexandre N. Pechev
DATE
2000
IEEE
83views Hardware» more  DATE 2000»
13 years 12 months ago
Wave Steered FSMs
In this paper we address the problem of designing very high throughput finite state machines (FSMs). The presence of loops in sequential circuits prevents a straightforward and g...
Luca Macchiarulo, Shih-Ming Shu, Malgorzata Marek-...
NIPS
2001
13 years 8 months ago
MIME: Mutual Information Minimization and Entropy Maximization for Bayesian Belief Propagation
Bayesian belief propagation in graphical models has been recently shown to have very close ties to inference methods based in statistical physics. After Yedidia et al. demonstrate...
Anand Rangarajan, Alan L. Yuille
AAAI
2011
12 years 7 months ago
An Online Spectral Learning Algorithm for Partially Observable Nonlinear Dynamical Systems
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
Byron Boots, Geoffrey J. Gordon
DM
2010
103views more  DM 2010»
13 years 7 months ago
Degree-bounded factorizations of bipartite multigraphs and of pseudographs
For d 1, s 0 a (d,d +s)-graph is a graph whose degrees all lie in the interval {d,d +1,...,d +s}. For r 1, a 0 an (r,r+1)-factor of a graph G is a spanning (r,r+a)-subgraph of...
Anthony J. W. Hilton