Sciweavers

746 search results - page 51 / 150
» Fast (Structured) Newton Computations
Sort
View
ESANN
2006
13 years 11 months ago
An algorithm for fast and reliable ESOM learning
The training of Emergent Self-organizing Maps (ESOM ) with large datasets can be a computationally demanding task. Batch learning may be used to speed up training. It is demonstrat...
Mario Nöcker, Fabian Mörchen, Alfred Ult...
ISM
2008
IEEE
110views Multimedia» more  ISM 2008»
14 years 4 months ago
A Hardware-Independent Fast Logarithm Approximation with Adjustable Accuracy
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
Oriol Vinyals, Gerald Friedland
ML
2010
ACM
142views Machine Learning» more  ML 2010»
13 years 8 months ago
Fast adaptive algorithms for abrupt change detection
We propose two fast algorithms for abrupt change detection in streaming data that can operate on arbitrary unknown data distributions before and after the change. The first algor...
Daniel Nikovski, Ankur Jain
CVPR
2011
IEEE
13 years 5 months ago
Novel 4-D Open-Curve Active Contour and Curve Completion Approach for Automated Tree Structure Extraction
We present novel approaches for fully automated extraction of tree-like tubular structures from 3-D image stacks. A 4-D Open-Curve Active Contour (Snake) model is proposed for sim...
Yu Wang, Arunachalam Narayanaswamy, Badri Roysam
GRAPHICSINTERFACE
2009
13 years 8 months ago
Fast low-memory streaming MLS reconstruction of point-sampled surfaces
We present a simple and efficient method for reconstructing triangulated surfaces from massive oriented point sample datasets. The method combines streaming and parallelization, m...
Gianmauro Cuccuru, Enrico Gobbetti, Fabio Marton, ...