Sciweavers

1282 search results - page 182 / 257
» Practical Loss-Resilient Codes
Sort
View
SAS
2012
Springer
208views Formal Methods» more  SAS 2012»
12 years 10 days ago
Finding Non-terminating Executions in Distributed Asynchronous Programs
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
Michael Emmi, Akash Lal
SIGSOFT
2008
ACM
14 years 10 months ago
Javert: fully automatic mining of general temporal properties from dynamic traces
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
Mark Gabel, Zhendong Su
PKC
2009
Springer
116views Cryptology» more  PKC 2009»
14 years 10 months ago
Improving the Boneh-Franklin Traitor Tracing Scheme
Abstract. Traitor tracing schemes are cryptographically secure broadcast methods that allow identification of conspirators: if a pirate key is generated by k traitors out of a stat...
Pascal Junod, Alexandre Karlov, Arjen K. Lenstra
POPL
2007
ACM
14 years 10 months ago
Lightweight fusion by fixed point promotion
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...
Atsushi Ohori, Isao Sasano
VTC
2008
IEEE
102views Communications» more  VTC 2008»
14 years 4 months ago
Channel Prediction Aided Multiuser Transmission in SDMA
— Transmit preprocessing employed at the basestation (BS) has been proposed for simplifying the design of the mobile receiver. Provided that the channel impulse response (CIR) of...
Wei Liu, Lie-Liang Yang, Lajos Hanzo