4744 search results - page 180 / 949 » Connected Computing |
151
Voted
TMC
2011
14 years 10 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
126
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
114
click to vote
ICN
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we propose a novel, cluster-based energy balancing scheme. We assume the existence of a fraction of “strong” nodes in terms of abundant storage, computing and co...
113
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
158
click to vote
DIALM
1999
ACM
15 years 7 months ago
1999
ACM
In this paper, we attempt to describe the evolving status of wireless communications and its impact on the future of mobile computing. We present a historical perspective and eluc...