Sciweavers

242 search results - page 17 / 49
» Approximately uniform random sampling in sensor networks
Sort
View
DCOSS
2009
Springer
14 years 2 months ago
Optimal Allocation of Time-Resources for Multihypothesis Activity-Level Detection
Abstract. The optimal allocation of samples for activity-level detection in a wireless body area network for health-monitoring applications is considered. A wireless body area netw...
Gautam Thatte, Viktor Rozgic, Ming Li, Sabyasachi ...
CVPR
2005
IEEE
13 years 9 months ago
Dense Photometric Stereo Using Tensorial Belief Propagation
We address the normal reconstruction problem by photometric stereo using a uniform and dense set of photometric images captured at fixed viewpoint. Our method is robust to spurio...
Kam-Lun Tang, Chi-Keung Tang, Tien-Tsin Wong
ICASSP
2009
IEEE
14 years 2 months ago
Structured variational methods for distributed inference in wireless ad hoc and sensor networks
Abstract –In this paper, a variational message passing framework is proposed for Markov random fields, which is computationally more efficient and admits wider applicability comp...
Yanbing Zhang, Huaiyu Dai
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 7 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
IMC
2006
ACM
14 years 1 months ago
On unbiased sampling for unstructured peer-to-peer networks
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...