Sciweavers

620 search results - page 62 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
IJCNN
2006
IEEE
15 years 5 months ago
Extraction of Components with Structured Variance
Abstract— We present a method for exploratory data analysis of large spatiotemporal data sets such as global longtime climate measurements, extending our previous work on semibli...
Alexander Ilin, Harri Valpola, Erkki Oja
WEA
2009
Springer
165views Algorithms» more  WEA 2009»
15 years 4 months ago
On Computational Models for Flash Memory Devices
Flash memory-based solid-state disks are fast becoming the dominant form of end-user storage devices, partly even replacing the traditional hard-disks. Existing two-level memory hi...
Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulric...
ECAI
2008
Springer
15 years 1 months ago
Online Rule Learning via Weighted Model Counting
Online multiplicative weight-update learning algorithms, such as Winnow, have proven to behave remarkably for learning simple disjunctions with few relevant attributes. The aim of ...
Frédéric Koriche
BMCBI
2011
14 years 3 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
ISBI
2004
IEEE
16 years 16 days ago
Quasi-Maximum Likelihood Blind Deconvolution of Images Acquired Through Scattering Media
We address the problem of restoration of images obtained through a scattering medium. We present an efficient quasimaximum likelihood blind deconvolution approach based on the fas...
Michael M. Bronstein, Alexander M. Bronstein, Yeho...