Sciweavers

892 search results - page 20 / 179
» An efficient terminal and model order reduction algorithm
Sort
View
ICCV
1999
IEEE
14 years 11 months ago
Dynamic Feature Ordering for Efficient Registration
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
Tat-Jen Cham, James M. Rehg
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
14 years 4 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert
MVA
2007
130views Computer Vision» more  MVA 2007»
13 years 10 months ago
3D Precise Inspection of Electronic Devices by Single Stereo Vision
It is very important to guarantee the quality of the industrial products by means of visual inspection. In order to reduce the soldering defect with terminal deformation and termi...
Takashi Watanabe, Akira Kusano, Takayuki Fujiwara,...
AUTOMATICA
2008
74views more  AUTOMATICA 2008»
13 years 9 months ago
Krylov projection framework for Fourier model reduction
This paper analyzes the Fourier model reduction (FMR) method from a rational Krylov projection framework and shows how the FMR reduced model, which has guaranteed stability and a ...
Serkan Gugercin, Karen Willcox
IPPS
1994
IEEE
14 years 1 months ago
Efficient Matrix Chain Ordering in Polylog Time
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
Phillip G. Bradford, Gregory J. E. Rawlins, Gregor...