3190 search results - page 21 / 638 » cans 2011 |
DM
2011
14 years 4 months ago
2011
We show that there exists a family of r-regular graphs of arbitrarily large excessive index for each integer r greater than 3. Furthermore, we answer a question in [1] showing tha...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper presents the least-mean-magnitude-phase (LMMP) algorithm for adaptive signal processing of complex-valued signals. The algorithm employs a decomposition of the meansqua...
ACL
2011
14 years 1 months ago
2011
We present an SCFG binarization algorithm that combines the strengths of early terminal matching on the source language side and early language model integration on the target lan...
CANS
2011
Springer
13 years 9 months ago
2011
Springer
Abstract. In this paper we analyze the recently proposed light-weight block cipher PRINTCipher. Applying algebraic methods and SAT-solving we are able to break 8 rounds of PRINTCip...
DLOG
2011
14 years 29 days ago
2011
We show that deciding conjunctive query inseparability for OWL 2 QL ontologies is PSpace-hard and in ExpTime. We give polynomial-time (incomplete) algorithms and demonstrate by exp...