3116 search results - page 541 / 624 » Recovering |
185
click to vote
ICFP
2004
ACM
16 years 7 months ago
2004
ACM
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
209
click to vote
ICDE
2010
IEEE
16 years 7 months ago
2010
IEEE
In this paper, we describe a scheme for tolerating and recovering from mid-query faults in a distributed shared nothing database. Rather than aborting and restarting queries, our s...
235
click to vote
PERCOM
2004
ACM
16 years 7 months ago
2004
ACM
Large sensor networks in applications such as surveillance and virtual classrooms, have to deal with the explosion of sensor information. Coherent presentation of data coming from...
189
click to vote
MOBISYS
2005
ACM
16 years 7 months ago
2005
ACM
This paper presents a new pairing protocol that allows two CPU-constrained wireless devices Alice and Bob to establish a shared secret at a very low cost. To our knowledge, this i...
245
Voted
Publication
Most conventional SFS (shape from shading) algorithms have been developed under the assumption of orthographic projection. However, the assumption is not valid when an object is no...