Sciweavers

413 search results - page 10 / 83
» Coding discretizations of continuous functions
Sort
View
CPHYSICS
2006
204views more  CPHYSICS 2006»
13 years 7 months ago
Genetically controlled random search: a global optimization method for continuous multidimensional functions
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
Ioannis G. Tsoulos, Isaac E. Lagaris
JAT
2011
93views more  JAT 2011»
13 years 2 months ago
Approximation theorems for group valued functions
Stone-Weierstrass-type theorems for groups of group-valued functions with discrete range or discrete domain are obtained. We study criteria for a subgroup of the group of continuou...
Jorge Galindo, Manuel Sanchis
CGF
2010
127views more  CGF 2010»
13 years 7 months ago
On Discrete Killing Vector Fields and Patterns on Surfaces
Symmetry is one of the most important properties of a shape, unifying form and function. It encodes semantic information on one hand, and affects the shape's aesthetic value ...
Mirela Ben-Chen, Adrian Butscher, Justin Solomon, ...
AAECC
2007
Springer
98views Algorithms» more  AAECC 2007»
13 years 7 months ago
Parametrizing compactly supported orthonormal wavelets by discrete moments
We discuss parametrizations of filter coefficients of scaling functions and compactly supported orthonormal wavelets with several vanishing moments. We introduce the first discr...
Georg Regensburger
RTAS
2003
IEEE
14 years 27 days ago
Modular Code Generation from Hybrid Automata based on Data Dependency
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...
Jesung Kim, Insup Lee