Sciweavers

11565 search results - page 2306 / 2313
» Computing Minimal Mappings
Sort
View
SIAMIS
2010
141views more  SIAMIS 2010»
13 years 2 months ago
Optimization by Stochastic Continuation
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
Marc C. Robini, Isabelle E. Magnin
SIAMJO
2010
130views more  SIAMJO 2010»
13 years 2 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
TCBB
2010
106views more  TCBB 2010»
13 years 2 months ago
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...
Christophe Godin, Pascal Ferraro
TEC
2010
191views more  TEC 2010»
13 years 2 months ago
Particle Swarm Optimization Aided Orthogonal Forward Regression for Unified Data Modeling
We propose a unified data modeling approach that is equally applicable to supervised regression and classification applications, as well as to unsupervised probability density func...
Sheng Chen, Xia Hong, Chris J. Harris
TIP
2010
277views more  TIP 2010»
13 years 2 months ago
Distance Regularized Level Set Evolution and Its Application to Image Segmentation
Level set methods have been widely used in image processing and computer vision. In conventional level set formulations, the level set function typically develops irregularities du...
Chunming Li, Chenyang Xu, Changfeng Gui, Martin D....
« Prev « First page 2306 / 2313 Last » Next »