Sciweavers

861 search results - page 32 / 173
» Faster integer multiplication
Sort
View
ECCV
2010
Springer
14 years 2 months ago
MRF Inference by k-Fan Decomposition and Tight Lagrangian Relaxation
We present a novel dual decomposition approach to MAP inference with highly connected discrete graphical models. Decompositions into cyclic k-fan structured subproblems are shown t...
IJISTA
2007
136views more  IJISTA 2007»
13 years 8 months ago
Optimisation-on-a-manifold for global registration of multiple 3D point sets
: We propose a novel algorithm to register multiple 3D point sets within a common reference frame simultaneously. Our approach performs an explicit optimisation on the manifold of ...
Shankar Krishnan, Pei Yean Lee, John B. Moore, Sur...
FOCS
2005
IEEE
14 years 2 months ago
Group-theoretic Algorithms for Matrix Multiplication
We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically fast...
Henry Cohn, Robert D. Kleinberg, Balázs Sze...
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
14 years 20 days ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn
ECOOP
1999
Springer
14 years 1 months ago
Multi-method Dispatch Using Multiple Row Displacement
Abstract. Multiple Row Displacement (MRD) is a new dispatch technique for multi-method languages. It is based on compressing an n-dimensional table using an extension of the single...
Candy Pang, Wade Holst, Yuri Leontiev, Duane Szafr...