17760 search results - page 377 / 3552 » A Generalization of the Massey-Ding Algorithm |
207
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
226
click to vote
CONSTRAINTS
2007
15 years 7 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
203
click to vote
JPDC
2006
15 years 7 months ago
2006
We propose a framework for defining agent-based models (ABMs) and two algorithms for the automatic parallelization of agent-based models, a general version P-ABMG for all ABMs def...
180
click to vote
PAAPP
2006
15 years 7 months ago
2006
In this paper, we investigate algorithms for generating communication code to run on distributedmemory systems. We modify algorithms from previously published work and prove that ...
221
Voted
TCS
2008
15 years 7 months ago
2008
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...