96 search results - page 10 / 20 » Path Hitting in Acyclic Graphs |
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
FQAS
2006
Springer
13 years 11 months ago
2006
Springer
We present a functional model for the analysis of large volumes of detailed transactional data, accumulated over time. In our model, the data schema is an acyclic graph with a sing...
PLDI
2004
ACM
14 years 24 days ago
2004
ACM
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
SAC
2005
ACM
14 years 28 days ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....