Sciweavers

5331 search results - page 45 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
CAD
2006
Springer
13 years 11 months ago
Computing minimum distance between two implicit algebraic surfaces
The minimum distance computation problem between two surfaces is very important in many applications such as robotics, CAD/CAM and computer graphics. Given two implicit algebraic ...
Xiao-Diao Chen, Jun-Hai Yong, Guo-Qin Zheng, Jean-...
AUTOMATICA
2004
128views more  AUTOMATICA 2004»
13 years 11 months ago
A convex optimization approach to the mode acceleration problem
The purpose of this note is to introduce an alternative procedure to the mode acceleration method when the underlying structure model includes damping. We will show that the probl...
S. O. Reza Moheimani, Dunant Halim
ARC
2012
Springer
317views Hardware» more  ARC 2012»
12 years 6 months ago
A High Throughput FPGA-Based Implementation of the Lanczos Method for the Symmetric Extremal Eigenvalue Problem
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
Abid Rafique, Nachiket Kapre, George A. Constantin...
SIAMNUM
2010
89views more  SIAMNUM 2010»
13 years 5 months ago
Convergence of a Fully Conservative Volume Corrected Characteristic Method for Transport Problems
We consider the convergence of a volume corrected characteristics-mixed method (VCCMM) for advection-diffusion systems. It is known that, without volume correction, the method is f...
Todd Arbogast, Wen-Hao Wang
ICCV
2007
IEEE
15 years 1 months ago
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
Martin Bujnak, Radim Sára