Sciweavers

2265 search results - page 435 / 453
» Recovering Exchanged Data
Sort
View
PODS
2008
ACM
178views Database» more  PODS 2008»
14 years 7 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel
MOBISYS
2008
ACM
14 years 7 months ago
Trustworthy and personalized computing on public kiosks
Many people desire ubiquitous access to their personal computing environments. We present a system in which a user leverages a personal mobile device to establish trust in a publi...
Scott Garriss, Ramón Cáceres, Stefan...
MOBIHOC
2004
ACM
14 years 7 months ago
Using labeled paths for loop-free on-demand routing in ad hoc networks
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...
Hari Rangarajan, J. J. Garcia-Luna-Aceves
SPAA
2009
ACM
14 years 4 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
EWSN
2010
Springer
14 years 4 months ago
Phoenix: An Epidemic Approach to Time Reconstruction
Abstract. Harsh deployment environments and uncertain run-time conditions create numerous challenges for postmortem time reconstruction methods. For example, motes often reboot and...
Jayant Gupchup, Douglas Carlson, Razvan Musaloiu-E...