3008 search results - page 350 / 602 » Independence in connected graphs |
157
click to vote
ICPR
2008
IEEE
16 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...
140
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
We investigate tradeoffs of various basic complexity measures such as size, space and width. We show examples of formulas that have optimal proofs with respect to any one of these...
192
click to vote
CAIP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Tracking of articulated objects is a challenging task in Computer Vision. A highly target specific model can improve the robustness of the tracking by eliminating or red...
150
click to vote
ICALT
2003
IEEE
16 years 3 days ago
2003
IEEE
Visualization of the learning processes is a powerful way to help students to understand their curricula and the structure behind them. CME2 is a prototype software of this favour...
202
click to vote
ISSS
1998
IEEE
15 years 11 months ago
1998
IEEE
False path analysis is an activity with applications in a variety of computer science and engineering domains like for instance high-level synthesis, worst case execution time est...