Sciweavers

913 search results - page 112 / 183
» Full Abstraction for Linda
Sort
View
HIPEAC
2010
Springer
14 years 28 days ago
Accelerating XML Query Matching through Custom Stack Generation on FPGAs
Abstract. Publish-subscribe systems present the state of the art in information dissemination to multiple users. Such systems have evolved from simple topic-based to the current XM...
Roger Moussalli, Mariam Salloum, Walid A. Najjar, ...
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
14 years 28 days ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
CAV
2010
Springer
172views Hardware» more  CAV 2010»
14 years 25 days ago
Symbolic Bounded Synthesis
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...
Rüdiger Ehlers
FC
2007
Springer
105views Cryptology» more  FC 2007»
14 years 24 days ago
Space-Efficient Private Search with Applications to Rateless Codes
Abstract. Private keyword search is a technique that allows for searching and retrieving documents matching certain keywords without revealing the search criteria. We improve the s...
George Danezis, Claudia Díaz
ICC
2007
IEEE
150views Communications» more  ICC 2007»
14 years 24 days ago
Fast Proactive Recovery from Concurrent Failures
Abstract-- Recovery of traffic in connectionless pure IP networks has traditionally been handled by a full re-convergence of the network state. This process operates in a time scal...
Audun Fosselie Hansen, Olav Lysne, Tarik Cicic, St...