2661 search results - page 206 / 533 » Quantum Complexity Classes |
142
click to vote
MFCS
2007
Springer
16 years 21 days 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...
154
click to vote
STACS
2007
Springer
16 years 20 days 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´...
160
click to vote
TLCA
2007
Springer
16 years 20 days 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...
157
click to vote
HYBRID
2005
Springer
16 years 2 days 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...
201
click to vote
PREMI
2005
Springer
16 years 1 days 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...