9842 search results - page 296 / 1969 » The Complexity of the Matching-Cut Problem |
122
Voted
CSL
2006
Springer
15 years 7 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
111
Voted
CRYPTO
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than ...
112
Voted
COLING
2008
15 years 5 months ago
2008
Recent years have witnessed a growing interest in analogical learning for NLP applications. If the principle of analogical learning is quite simple, it does involve complex steps ...
182
Voted
STAIRS
2008
15 years 5 months ago
2008
This paper presents an extensive evaluation, on artificial datasets, of EDY, an unsupervised algorithm for automatically synthesizing a Structured Hidden Markov Model (S-HMM) from ...
117
Voted
NAACL
2003
15 years 5 months ago
2003
Large-scale parsing is still a complex and timeconsuming process, often so much that it is infeasible in real-world applications. The parsing system described here addresses this ...