Sciweavers

257 search results - page 13 / 52
» Computability over The Partial Continuous Functionals
Sort
View
APAL
2002
73views more  APAL 2002»
13 years 9 months ago
The sequentially realizable functionals
We consider a notion of sequential functional of finite type, more generous than the familiar notion embodied in Plotkin's language PCF. We study both the "full" an...
John Longley
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
14 years 4 months ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
TVCG
2010
162views more  TVCG 2010»
13 years 8 months ago
Computing Robustness and Persistence for Images
—We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology c...
Paul Bendich, Herbert Edelsbrunner, Michael Kerber
ICFP
2006
ACM
14 years 10 months ago
Algebraic fusion of functions with an accumulating parameter and its improvement
We present a unifying solution to the problem of fusion of functions, where both the producer function and the consumer function have one accumulating parameter. The key idea in t...
Shin-ya Katsumata, Susumu Nishimura
VLSID
2003
IEEE
82views VLSI» more  VLSID 2003»
14 years 10 months ago
SPaRe: Selective Partial Replication for Concurrent Fault Detection in FSMs
We propose a non-intrusive methodology for concurrent fault detection in FSMs. The proposed method is similar to duplication, wherein a replica of the circuit acts as a predictor ...
Petros Drineas, Yiorgos Makris