Sciweavers

489 search results - page 85 / 98
» Towards an Analysis of Local Optimization Algorithms
Sort
View
CVPR
2004
IEEE
14 years 9 months ago
Shape Correspondence through Landmark Sliding
Motivated by improving statistical shape analysis, this paper presents a novel landmark-based method for accurate shape correspondence, where the general goal is to align multiple...
Song Wang, Toshiro Kubota, Theodor Richardson
ICIP
2005
IEEE
14 years 1 months ago
Automatic registration of 3D datasets using Gaussian fields
—In this paper we introduce a new 3D automatic registration method based on Gaussian fields and energy minimization. The method defines a simple ∞ C energy function, which is c...
Faysal Boughorbel, Andreas Koschan, Mongi A. Abidi
ICCS
2009
Springer
13 years 5 months ago
Evaluating the Jaccard-Tanimoto Index on Multi-core Architectures
The Jaccard/Tanimoto coefficient is an important workload, used in a large variety of problems including drug design fingerprinting, clustering analysis, similarity web searching a...
Vipin Sachdeva, Douglas M. Freimuth, Chris Mueller
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 8 months ago
Parameterizing pair approximations for takeover dynamics
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
Joshua L. Payne, Margaret J. Eppstein
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 1 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang