Sciweavers

499 search results - page 48 / 100
» Constructive Induction by Analogy
Sort
View
ICASSP
2009
IEEE
14 years 2 months ago
Interval consensus: From quantized gossip to voting
We design distributed and quantized average consensus algorithms on arbitrary connected networks. By construction, quantized algorithms cannot produce a real, analog average. Inst...
Florence Bénézit, Patrick Thiran, Ma...
MFCS
2005
Springer
14 years 1 months ago
Dimension Is Compression
Abstract. Effective fractal dimension was defined by Lutz (2003) in order to quantitatively analyze the structure of complexity classes. Interesting connections of effective dim...
María López-Valdés, Elvira Ma...
EUROCAST
1997
Springer
85views Hardware» more  EUROCAST 1997»
13 years 12 months ago
Turing Universality of Neural Nets (Revisited)
We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. W...
João Pedro Guerreiro Neto, Hava T. Siegelma...
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 7 months ago
Transdichotomous Results in Computational Geometry, II: Offline Search
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
Timothy M. Chan, Mihai Patrascu
DCG
2008
90views more  DCG 2008»
13 years 7 months ago
Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that t...
Louis J. Billera, Samuel K. Hsiao, J. Scott Provan