Sciweavers

1289 search results - page 44 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
ICASSP
2008
IEEE
14 years 5 months ago
Parametric estimation of affine deformations of binary images
We consider the problem of planar object registration on binary images where the aligning transformation is restricted to the group of affine transformations. Previous approaches...
Csaba Domokos, Zoltan Kato, Joseph M. Francos
BMCBI
2010
132views more  BMCBI 2010»
13 years 11 months ago
An interaction-motif-based scoring function for protein-ligand docking
Background: A good scoring function is essential for molecular docking computations. In conventional scoring functions, energy terms modeling pairwise interactions are cumulativel...
Zhong-Ru Xie, Ming-Jing Hwang
ICIP
2006
IEEE
15 years 19 days ago
The Snakuscule
Traditional snakes, or active contours, are planar parametric curves. Their parameters are determined by optimizing the weighted sum of three energy terms: one depending on the dat...
Michael Unser, Philippe Thévenaz
WCE
2007
14 years 4 days ago
Local Approximation of Pareto Surface
—In the design process of complex systems, the designer is solving an optimization problem, which involves different disciplines and where all design criteria have to be optimize...
S. V. Utyuzhnikov, Jeremy Maginot, Marin D. Guenov
ISCAS
1999
IEEE
106views Hardware» more  ISCAS 1999»
14 years 3 months ago
Adaptive minimax filtering via recursive optimal quadratic approximations
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
S. Gollamudi, Yih-Fang Huang