Sciweavers

580 search results - page 10 / 116
» On the memory complexity of the forward-backward algorithm
Sort
View
ICPP
1999
IEEE
13 years 12 months ago
FLB: Fast Load Balancing for Distributed-Memory Machines
This paper describes a novel compile-time list-based task scheduling algorithm for distributed-memory systems, called Fast Load Balancing (FLB). Compared to other typical list sch...
Andrei Radulescu, Arjan J. C. van Gemund
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
13 years 11 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
AAAI
2011
12 years 7 months ago
An Online Spectral Learning Algorithm for Partially Observable Nonlinear Dynamical Systems
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
Byron Boots, Geoffrey J. Gordon
TCOM
2010
133views more  TCOM 2010»
13 years 2 months ago
Low-complexity decoding for non-binary LDPC codes in high order fields
In this paper, we propose a new implementation of the Extended Min-Sum (EMS) decoder for non-binary LDPC codes. A particularity of the new algorithm is that it takes into accounts...
Adrian Voicila, David Declercq, François Ve...
EDBT
2009
ACM
100views Database» more  EDBT 2009»
14 years 8 days ago
A view selection algorithm with performance guarantee
A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually me...
Nicolas Hanusse, Sofian Maabout, Radu Tofan