Sciweavers

4850 search results - page 771 / 970
» Proof and Computation in Geometry
Sort
View
DSN
2003
IEEE
15 years 12 months ago
N-Way Fail-Over Infrastructure for Reliable Servers and Routers
Maintaining the availability of critical servers and routers is an important concern for many organizations. At the lowest level, IP addresses represent the global namespace by wh...
Yair Amir, Ryan Caudy, Ashima Munjal, Theo Schloss...
DSN
2003
IEEE
15 years 12 months ago
Compiler-Directed Program-Fault Coverage for Highly Available Java Internet Services
Abstract: We present a new approach that uses compilerdirected fault-injection for coverage testing of recovery code in Internet services to evaluate their robustness to operating ...
Chen Fu, Richard P. Martin, Kiran Nagaraja, Thu D....
FOCS
2003
IEEE
15 years 12 months ago
A Lattice Problem in Quantum NP
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
Dorit Aharonov, Oded Regev
FOCS
2003
IEEE
15 years 12 months ago
Always Good Turing: Asymptotically Optimal Probability Estimation
While deciphering the Enigma Code during World War II, I.J. Good and A.M. Turing considered the problem of estimating a probability distribution from a sample of data. They derive...
Alon Orlitsky, Narayana P. Santhanam, Junan Zhang
FOCS
2002
IEEE
15 years 11 months ago
Covering Problems with Hard Capacities
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
Julia Chuzhoy, Joseph Naor