37 search results - page 8 / 8 » The Complexity of Orbits of Computably Enumerable Sets |
DAGSTUHL
2007
13 years 9 months ago
2007
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We introduce a novel protection scheme, called Cooperative Fast Protection (CFP), to fight against a single link failure in survivable WDM (Wavelength Division Multiplexing) mes...