2265 search results - page 435 / 453 » Recovering Exchanged Data |
102
click to vote
PODS
2008
ACM
15 years 11 months ago
2008
ACM
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...
109
Voted
MOBISYS
2008
ACM
15 years 10 months ago
2008
ACM
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...
MOBIHOC
2004
ACM
15 years 10 months ago
2004
ACM
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...
SPAA
2009
ACM
15 years 8 months ago
2009
ACM
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...
89
Voted
EWSN
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Harsh deployment environments and uncertain run-time conditions create numerous challenges for postmortem time reconstruction methods. For example, motes often reboot and...