Sciweavers

254 search results - page 46 / 51
» Binary amiable Words
Sort
View
CSL
2008
Springer
15 years 21 days ago
On the Almighty Wand
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
Rémi Brochenin, Stéphane Demri, &Eac...
106
Voted
DIAGRAMS
2008
Springer
15 years 21 days ago
Visualizing Non-subordination and Multidominance in Tree Diagrams: Testing Five Syntax Tree Variants
In linguistics, it is quite common to use tree diagrams for immediate constituent analysis of sentences. Traditionally, these trees are binary and twodimensional. However, phenomen...
Leonie Bosveld-de Smet, Mark de Vries
96
Voted
DAGSTUHL
2007
15 years 11 days ago
QUAD: Overview and Recent Developments
We give an outline of the specification and provable security features of the QUAD stream cipher proposed at Eurocrypt 2006 [6]. The cipher relies on the iteration of a multivaria...
David Arditti, Côme Berbain, Olivier Billet,...
97
Voted
DGO
2007
152views Education» more  DGO 2007»
15 years 11 days ago
Identifying and classifying subjective claims
To understand the subjective documents, for example, public comments on the government’s proposed regulation, opinion identification and classification is required. Rather than ...
Namhee Kwon, Liang Zhou, Eduard H. Hovy, Stuart W....
73
Voted
ISSA
2008
15 years 10 days ago
Application of Message Digests for the Verification of Logical Forensic Data
A message digest is a fixed length output produced by applying a cryptographic algorithm on input binary data of arbitrary length. If the input data changes even by one bit, the g...
Pontjho Mokhonoana, Martin S. Olivier