15033 search results - page 2588 / 3007 » Complexity Theory and Algorithms |
194
click to vote
CPM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
225
click to vote
DAGSTUHL
2007
15 years 8 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...
177
click to vote
SIROCCO
2010
15 years 8 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 ...
210
click to vote
NIPS
2008
15 years 8 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 ...
177
Voted
FLAIRS
2006
15 years 8 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 ...