Sciweavers

106 search results - page 13 / 22
» Explicit and Implicit Enforcing - Randomized Optimization
Sort
View
CGF
2010
157views more  CGF 2010»
13 years 4 months ago
Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
Vladimir Molchanov, Paul Rosenthal, Lars Linsen
ICMCS
2008
IEEE
168views Multimedia» more  ICMCS 2008»
14 years 1 months ago
A co-design platform for algorithm/architecture design exploration
The efficient implementation of multimedia algorithms, for the ever increasing complexity of the specifications and the emergence of the new generation of processing platforms c...
Christophe Lucarz, Marco Mattavelli, Julien Dubois
ICPR
2008
IEEE
14 years 1 months ago
A new multiobjective simulated annealing based clustering technique using stability and symmetry
Most clustering algorithms operate by optimizing (either implicitly or explicitly) a single measure of cluster solution quality. Such methods may perform well on some data sets bu...
Sriparna Saha, Sanghamitra Bandyopadhyay
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...
FOGA
1994
13 years 8 months ago
The Schema Theorem and Price's Theorem
Holland's Schema Theorem is widely taken to be the foundation for explanations of the power of genetic algorithms (GAs). Yet some dissent has been expressed as to its implica...
Lee Altenberg