Sciweavers

1042 search results - page 25 / 209
» Failing First: An Update
Sort
View
ICS
1999
Tsinghua U.
15 years 2 months ago
Fast cluster failover using virtual memory-mapped communication
This paper proposes a novel way to use virtual memorymapped communication (VMMC) to reduce the failover time on clusters. With the VMMC model, applications’ virtual address spac...
Yuanyuan Zhou, Peter M. Chen, Kai Li
ICCCN
1998
IEEE
15 years 2 months ago
Fast Recovery Protocol for Database and Link Failures in Mobile Networks
An important issue in the design of future Personal Communication Services (PCS) networks is the efficient management of location information. The current IS-41 standard P C S arc...
Govind Krishnamurthi, Stefano Chessa, Arun K. Soma...
SWAT
2000
Springer
107views Algorithms» more  SWAT 2000»
15 years 1 months ago
A New Trade-Off for Deterministic Dictionaries
We consider dictionaries over the universe U = {0, 1}w on a unit-cost RAM with word size w and a standard instruction set. We present a linear space deterministic dictionary with m...
Rasmus Pagh
ACNS
2010
Springer
114views Cryptology» more  ACNS 2010»
15 years 1 months ago
Two New Efficient PIR-Writing Protocols
Assume that a client outsources his database to a remote storage-provider (the server), so that for privacy reasons, the client's database is encrypted by his secret key. Duri...
Helger Lipmaa, Bingsheng Zhang
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 7 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld