Sciweavers

16430 search results - page 831 / 3286
» On Computable Tree Functions
Sort
View
JC
2008
96views more  JC 2008»
15 years 7 months ago
Adaptivity and computational complexity in the numerical solution of ODEs
In this paper we analyze the problem of adaptivity for one-step numerical methods for solving ODEs, both IVPs and BVPs, with a view to generating grids of minimal computational co...
Silvana Ilie, Gustaf Söderlind, Robert M. Cor...
PAMI
2006
126views more  PAMI 2006»
15 years 7 months ago
Estimation of Nonlinear Errors-in-Variables Models for Computer Vision Applications
In an errors-in-variables (EIV) model, all the measurements are corrupted by noise. The class of EIV models with constraints separable into the product of two nonlinear functions, ...
Bogdan Matei, Peter Meer
IJON
2007
93views more  IJON 2007»
15 years 7 months ago
Computing with active dendrites
This paper introduces a new model of a spiking neuron with active dendrites and dynamic synapses (ADDS). The neuron employs the dynamics of the synapses and the active properties ...
Christo Panchev
JVCA
2007
151views more  JVCA 2007»
15 years 7 months ago
Computer aided generation of stylized maps
Geographic maps have existed from early stages of human civilization. Various styles of visualizing the geographic information have evolved depending on the nature of information ...
Neeharika Adabala, Manik Varma, Kentaro Toyama
CORR
2004
Springer
123views Education» more  CORR 2004»
15 years 7 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui