Sciweavers

699 search results - page 15 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
ICPR
2008
IEEE
15 years 11 months ago
A new approach to 3D shape recovery of local planar surface patches from shift-variant blurred images
A new approach is presented for 3D shape recovery of local planar surface patches from two shift/spacevariant defocused images. It is based on a recently proposed technique for in...
Murali Subbarao, Xue Tu, Youn-sik Kang
CORR
2008
Springer
113views Education» more  CORR 2008»
14 years 9 months ago
A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
Paul Tarau
TEC
2012
195views Formal Methods» more  TEC 2012»
13 years 2 days ago
The Effects of Constant and Bit-Wise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation Rates
Kimura’s neutral theory of evolution has inspired researchers from the evolutionary computation community to incorporate neutrality into Evolutionary Algorithms (EAs) in the hop...
Riccardo Poli, Edgar Galván López
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
14 years 9 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
CORR
2010
Springer
115views Education» more  CORR 2010»
14 years 9 months ago
Optimal topological simplification of discrete functions on surfaces
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
Ulrich Bauer, Carsten Lange, Max Wardetzky