2661 search results - page 206 / 533 » Quantum Complexity Classes |
106
Voted
MFCS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on t...
123
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
116
Voted
TLCA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
116
Voted
HYBRID
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Motivated by three applications which are under investigation at the Honeywell Research Laboratory in Minneapolis, we introduce a class of large scale control problems. I...
147
Voted
PREMI
2005
Springer
15 years 9 months ago
2005
Springer
Frequent Pattern Mining (FPM) is a very powerful paradigm for mining informative and useful patterns in massive, complex datasets. In this paper we propose the Data Mining Template...