Sciweavers

66 search results - page 8 / 14
» Contouring Discrete Indicator Functions
Sort
View
NC
2007
123views Neural Networks» more  NC 2007»
13 years 7 months ago
The complexity of latching transitions in large scale cortical networks
Abstract. We study latching dynamics, i.e. the ability of a network to hop spontaneously from one discrete attractor state to another, which has been proposed as a model of an inï¬...
Emilio Kropff, Alessandro Treves
DILS
2007
Springer
14 years 1 months ago
Fast Approximate Duplicate Detection for 2D-NMR Spectra
2D-Nuclear magnetic resonance (NMR) spectroscopy is a powerful analytical method to elucidate the chemical structure of molecules. In contrast to 1D-NMR spectra, 2D-NMR spectra cor...
Björn Egert, Steffen Neumann, Alexander Hinne...
SCL
2008
82views more  SCL 2008»
13 years 7 months ago
An efficient algorithm for positive realizations
We observe that successive applications of known results from the theory of positive systems lead to an efficient general algorithm for positive realizations of transfer functions...
Wojciech Czaja, Philippe Jaming, Máté...
APPML
2005
101views more  APPML 2005»
13 years 7 months ago
A posteriori discontinuous Galerkin error estimates for transient convection-diffusion equations
A posteriori error estimates are derived for unsteady convection-diffusion equations discretized with the non-symmetric interior penalty and the local discontinuous Galerkin metho...
Alexandre Ern, Jennifer Proft
ECCV
2006
Springer
14 years 9 months ago
An Integral Solution to Surface Evolution PDEs Via Geo-cuts
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...
Yuri Boykov, Vladimir Kolmogorov, Daniel Cremers, ...