451 search results - page 51 / 91 » On Parameterized Exponential Time Complexity |
CSL
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. Abduction is a fundamental mode of reasoning, which has taken on increasing importance in Artificial Intelligence (AI) and related disciplines. Computing abductive expla...
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
CLEF
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Recent research has suggested that there is no general similarity measure, which can be applied on arbitrary databases without any parameterization. Hence, the optimal co...
TCOM
2010
13 years 4 months ago
2010
Abstract--In order to release the growing demand for computational complexity with respect to increasing information sequence length in the priority-first search decoding algorithm...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
This paper presents a new method for extracting orthogonal bases from AM-FM signals. Since AM-FM signals are non-stationary, appropriate basis functions are sought provided that i...