Sciweavers

3937 search results - page 632 / 788
» Questioning Ubiquitous Computing
Sort
View
STOC
2002
ACM
80views Algorithms» more  STOC 2002»
14 years 10 months ago
Strict polynomial-time in simulation and extraction
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
Boaz Barak, Yehuda Lindell
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 9 months ago
Approximate quantiles and the order of the stream
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
Sudipto Guha, Andrew McGregor
MOBISYS
2003
ACM
14 years 9 months ago
iFlow: Middleware-assisted Rendezvous-based Information Access for Mobile Ad Hoc Applications
Due to node mobility and limitations on bandwidth availability in wireless channels, there exist unique challenges towards achieving efficient and effective information access in ...
Zongpeng Li, Baochun Li, Dongyan Xu, Xin Zhou
MOBIHOC
2007
ACM
14 years 9 months ago
Capacity of multi-channel wireless networks with random (c, f) assignment
The issue of transport capacity of a randomly deployed wireless network under random (c, f ) channel assignment was considered by us in [1]. We showed in [1] that when the number ...
Vartika Bhandari, Nitin H. Vaidya
EWSN
2008
Springer
14 years 9 months ago
Characterizing Mote Performance: A Vector-Based Methodology
Sensors networks instrument the physical space using motes that run network embedded programs thus acquiring, processing, storing and transmitting sensor data. The motes commercial...
Martin Leopold, Marcus Chang, Philippe Bonnet