Sciweavers

1150 search results - page 56 / 230
» Note from the Editor
Sort
View
WIA
2005
Springer
14 years 1 months ago
Shorter Regular Expressions from Finite-State Automata
We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regul...
Yo-Sub Han, Derick Wood
PKC
2010
Springer
161views Cryptology» more  PKC 2010»
13 years 9 months ago
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
ded abstract of this paper appears in 13th International Conference on Practice and Theory in Public Key Cryptography (PKC) 2010, Lecture Notes in Computer Science Vol. ?, P. Nguye...
Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, Vi...
FPGA
2008
ACM
623views FPGA» more  FPGA 2008»
13 years 9 months ago
From the bitstream to the netlist
We present an in-depth analysis of the Xilinx bitstream format. The information gathered in this paper allows bitstream compilation and decompilation. While not actually compromis...
Jean-Baptiste Note, Éric Rannaud
GI
2004
Springer
14 years 1 months ago
A Formal Correctness Proof for Code Generation from SSA Form in Isabelle/HOL
Abstract: Optimizations in compilers are the most error-prone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is ne...
Jan Olaf Blech, Sabine Glesner
MOBIQUITOUS
2007
IEEE
14 years 2 months ago
On Adjusting Power to Defend Wireless Networks from Jamming
— Wireless networks are susceptible to accidental or intentional radio interference. One way to cope with this threat is to have the radios compete with the jammer, whereby the n...
Wenyuan Xu