Sciweavers

Share
VMCAI
2012
Springer
8 years 5 months ago
A General Framework for Probabilistic Characterizing Formulae
Abstract. Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae o...
Joshua Sack, Lijun Zhang
CORR
2011
Springer
181views Education» more  CORR 2011»
9 years 4 months ago
Octal Bent Generalized Boolean Functions
In this paper we characterize (octal) bent generalized Boolean functions defined on Zn 2 with values in Z8. Moreover, we propose several constructions of such generalized bent fun...
Pante Stanica, Thor Martinsen
CORR
2010
Springer
142views Education» more  CORR 2010»
9 years 6 months ago
Constructions of Optical Queues With a Limited Number of Recirculations--Part I: Greedy Constructions
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
Jay Cheng, Cheng-Shang Chang, Sheng-Hua Yang, Tsz-...
BSL
2010
9 years 6 months ago
Almost disjoint families and diagonalizations of length continuum
Abstract. We present a survey of some results and problems concerning constructions which require a diagonalization of length continuum to be carried out, particularly construction...
Dilip Raghavan
ICC
2009
IEEE
155views Communications» more  ICC 2009»
9 years 7 months ago
On Hashing with Tweakable Ciphers
Cryptographic hash functions are often built on block ciphers in order to reduce the security of the hash to that of the cipher, and to minimize the hardware size. Proven secure co...
Raphael Chung-Wei Phan, Jean-Philippe Aumasson
IALP
2009
9 years 7 months ago
Improving the Performance of the Link Parser
The paper describes an approach to extend the coverage of a Link Grammar based parser on the constructions that are not being handled currently by the grammar. There are about thir...
Yalamanchi Viswanatha Naidu, Anil Kumar Singh, Dip...
PROVSEC
2010
Springer
9 years 7 months ago
Efficient Confirmer Signatures from the "Signature of a Commitment" Paradigm
Generic constructions of designated confirmer signatures follow one of the following two strategies; either produce a digital signature on the message to be signed, then encrypt th...
Laila El Aimani
JOC
2010
106views more  JOC 2010»
9 years 7 months ago
A Taxonomy of Pairing-Friendly Elliptic Curves
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairingbased cryptographic systems. Such “pairing-friendly” curv...
David Freeman, Michael Scott, Edlyn Teske
QUESTA
2007
88views more  QUESTA 2007»
9 years 9 months ago
A simple proof for the constructions of optical priority queues
Constructions of optical queues by optical Switches and fiber Delay Lines (SDL) have received a lot of attention lately. In this short paper, we provide a simple proof for the co...
Hsien-Chen Chiu, Cheng-Shang Chang, Jay Cheng, Dua...
GRAMMARS
2002
116views more  GRAMMARS 2002»
9 years 9 months ago
An Informal Sketch of a Formal Architecture for Construction Grammar
Abstract. A formal architecture for Construction Grammar (CG) is sketched. Modeling domain objects (constructs) are constituent structures with feature structures at the nodes, aka...
Paul Kay
books