1379 search results - page 113 / 276 » Dynamic Program Slicing in Understanding of Program Executio... |
102
click to vote
MICCAI
2002
Springer
16 years 4 months ago
2002
Springer
Abstract. In this paper, we present an automated method for colon registration. The method uses dynamic programming to align data defined on colon center-line paths, as extracted f...
133
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
The infinite hidden Markov model is a nonparametric extension of the widely used hidden Markov model. Our paper introduces a new inference algorithm for the infinite Hidden Markov...
138
Voted
NIPS
2008
15 years 5 months ago
2008
We introduce a new probability distribution over a potentially infinite number of binary Markov chains which we call the Markov Indian buffet process. This process extends the IBP...
156
Voted
CSMR
2007
IEEE
15 years 10 months ago
2007
IEEE
A dynamic object process graph is a view on the control flow graph from the perspective of a single object. It has been shown that such a graph can be a useful starting point for...
131
Voted
SPAA
1995
ACM
15 years 7 months ago
1995
ACM
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...