10608 search results - page 1664 / 2122 » Complexity of O'Hara's Algorithm |
171
click to vote
DAGSTUHL
2007
15 years 6 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...
135
click to vote
SIROCCO
2010
15 years 6 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
166
click to vote
NIPS
2008
15 years 6 months ago
2008
Language and image understanding are two major goals of artificial intelligence which can both be conceptually formulated in terms of parsing the input signal into a hierarchical ...
137
Voted
RIVF
2007
15 years 6 months ago
2007
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
146
Voted
FLAIRS
2006
15 years 6 months ago
2006
Autonomous robots, such as automatic vacuum cleaners, toy robot dogs, and autonomous vehicles for the military, are rapidly becoming a part of everyday life. As a result the need ...