23 search results - page 5 / 5 » Unconstrained Parametric Minimization of a Polynomial: Appro... |
ICVGIP
2008
13 years 7 months ago
2008
The primitives of point-based representations are independent but are rendered using surfels, which approximate the immediate neighborhood of each point linearly. A large number o...
JGO
2010
13 years 17 days ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
WABI
2009
Springer
14 years 11 days ago
2009
Springer
We present biRNA, a novel algorithm for prediction of binding sites between two RNAs based on minimization of binding free energy. Similar to RNAup approach [30], we assume the bin...