360 search results - page 48 / 72 » Distributed Network Querying with Bounded Approximate Cachin... |
138
Voted
ICDCS
2007
IEEE
15 years 7 months ago
2007
IEEE
In recent work, we proposed D-Trigger, a framework for tracking a global condition over a large network that allows us to detect anomalies while only collecting a very limited amo...
127
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
—Distributed orthogonal space–time block codes (DOSTBCs) achieving full-diversity order and single-symbol maximum-likelihood (ML) decodability have been introduced recently by ...
114
Voted
COMPSAC
2007
IEEE
15 years 10 months ago
2007
IEEE
Service discovery is very useful in pervasive computing environments. A service discovery architecture based on anycast is proposed. A wellknown anycast address is defined first, ...
178
Voted
DCOSS
2008
Springer
15 years 5 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
132
click to vote
OSDI
2008
ACM
16 years 3 months ago
2008
ACM
Although queueing models have long been used to model the performance of computer systems, they are out of favor with practitioners, because they have a reputation for requiring u...