Sciweavers

948 search results - page 66 / 190
» What can we achieve by arbitrary announcements
Sort
View
WORDS
2003
IEEE
14 years 29 days ago
Decentralized Resource Management and Fault-Tolerance for Distributed CORBA Applications
Assigning an application’s fault-tolerance properties (e.g., replication style, checkpointing frequency) statically, and in an arbitrary manner, can lead to the application not ...
Carlos F. Reverte, Priya Narasimhan
EUROGRAPHICS
2010
Eurographics
13 years 8 months ago
Scalable Height Field Self-Shadowing
We present a new method suitable for general purpose graphics processing units to render self-shadows on dynamic height fields under dynamic light environments in real-time. Visib...
Ville Timonen and Jan Westerholm
ECCC
2010
79views more  ECCC 2010»
13 years 7 months ago
IP = PSPACE using Error Correcting Codes
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
Or Meir
MJ
2006
138views more  MJ 2006»
13 years 7 months ago
A CAM-based keyword match processor architecture
This paper demonstrates a keyword match processor capable of performing fast dictionary search with approximate match capability. Using a content addressable memory with processor...
Long Bu, John A. Chandy
JSW
2007
96views more  JSW 2007»
13 years 7 months ago
IP-based Clustering for Peer-to-Peer Overlays
— The efficiency of overlay networks built on top of the IP network is often threatened by the mismatch between the topologies of the overlay and the underlying IP network, resu...
Piotr Karwaczynski, Jaka Mocnik