Sciweavers

3134 search results - page 334 / 627
» Computing full disjunctions
Sort
View
LICS
2009
IEEE
15 years 7 months ago
An Improved Lower Bound for the Complementation of Rabin Automata
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
Yang Cai, Ting Zhang, Haifeng Luo
CALCO
2009
Springer
159views Mathematics» more  CALCO 2009»
15 years 7 months ago
Complete Iterativity for Algebras with Effects
Abstract. Completely iterative algebras (cias) are those algebras in which recursive equations have unique solutions. In this paper we study complete iterativity for algebras with ...
Stefan Milius, Thorsten Palm, Daniel Schwencke
137
Voted
DEXA
2009
Springer
138views Database» more  DEXA 2009»
15 years 7 months ago
Evaluating Non-In-Place Update Techniques for Flash-Based Transaction Processing Systems
Recently, flash memory is emerging as the storage device. With price sliding fast, the cost per capacity is approaching to that of SATA disk drives. So far flash memory has been ...
Yongkun Wang, Kazuo Goda, Masaru Kitsuregawa
126
Voted
IMA
2009
Springer
221views Cryptology» more  IMA 2009»
15 years 7 months ago
Cache Timing Analysis of LFSR-Based Stream Ciphers
Cache timing attacks are a class of side-channel attacks that is applicable against certain software implementations. They have generated significant interest when demonstrated ag...
Gregor Leander, Erik Zenner, Philip Hawkes
96
Voted
MDM
2009
Springer
118views Communications» more  MDM 2009»
15 years 7 months ago
DigestJoin: Exploiting Fast Random Reads for Flash-Based Joins
Abstract—Flash disks have been an emerging secondary storage media. In particular, there have been portable devices, multimedia players and laptop computers that are configured ...
Yu Li, Sai Tung On, Jianliang Xu, Byron Choi, Haib...