Sciweavers

1729 search results - page 324 / 346
» Generic Haskell: Applications
Sort
View
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
14 years 3 months ago
Pseudorandom Generators and Typically-Correct Derandomization
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel
CASES
2009
ACM
14 years 3 months ago
Tight WCRT analysis of synchronous C programs
Accurate estimation of the tick length of a synchronous program is essential for efficient and predictable implementations that are devoid of timing faults. The techniques to dete...
Partha S. Roop, Sidharta Andalam, Reinhard von Han...
CF
2009
ACM
14 years 3 months ago
Space-and-time efficient garbage collectors for parallel systems
As multithreaded server applications and runtime systems prevail, garbage collection is becoming an essential feature to support high performance systems. The fundamental issue of...
Shaoshan Liu, Ligang Wang, Xiao-Feng Li, Jean-Luc ...
EICS
2009
ACM
14 years 3 months ago
Edit, inspect and connect your surroundings: a reference framework for meta-UIs
Discovering and unlocking the full potential of complex pervasive environments is still approached in application-centric ways. A set of statically deployed applications often deï...
Geert Vanderhulst, Daniel Schreiber, Kris Luyten, ...
IWCMC
2009
ACM
14 years 3 months ago
Dynamic trust establishment in emergency ad hoc networks
This paper proposes a dynamic trust establishment protocol that enables the nodes of an ad hoc network to establish security associations among each other in a distributed and pee...
Christos A. Papageorgiou, Konstantinos Birkos, Tas...