Sciweavers

1220 search results - page 82 / 244
» Restricting grammatical complexity
Sort
View
STACS
2009
Springer
14 years 2 months ago
Tractable Structures for Constraint Satisfaction with Truth Tables
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
Dániel Marx
ICC
2009
IEEE
125views Communications» more  ICC 2009»
14 years 2 months ago
Cryptanalysis of Substitution Cipher Chaining Mode (SCC)
In this paper, we present an enhanced cryptanalysis of the Substitution Cipher Chaining mode (SCC) [1]. In [2], SCC-128 (SCC which uses AES with 128-bit key) was broken using 5 att...
Mohamed Abo El-Fotouh, Klaus Diepold
FSTTCS
2009
Springer
14 years 2 months ago
The Wadge Hierarchy of Max-Regular Languages
Recently, Mikołaj Boja´nczyk introduced a class of max-regular languages, an extension of regular languages of infinite words preserving many of its usual properties. This new c...
Jérémie Cabessa, Jacques Duparc, Ale...
ICC
2007
IEEE
14 years 2 months ago
Turbo Multiuser Detection Based on Local Search Algorithms
—The full-complexity soft-input/soft-output (SISO) multiuser detector based on the a posteriori probability (APP) algorithm has a computational complexity growing exponentially w...
Zhiliang Qin, Kui Cai, Xiaoxin Zou
ESWS
2007
Springer
14 years 1 months ago
Acquisition of OWL DL Axioms from Lexical Resources
State-of-the-art research on automated learning of ontologies from text currently focuses on inexpressive ontologies. The acquisition of complex axioms involving logical connective...
Johanna Völker, Pascal Hitzler, Philipp Cimia...