10988 search results - page 1744 / 2198 » Algorithmic Folding Complexity |
206
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
170
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,...
194
click to vote
DAGSTUHL
2007
15 years 7 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...
153
click to vote
SIROCCO
2010
15 years 7 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 ...
186
click to vote
NIPS
2008
15 years 7 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 ...