Sciweavers

242 search results - page 38 / 49
» Approximately uniform random sampling in sensor networks
Sort
View
ICPR
2010
IEEE
14 years 1 days ago
Motif Discovery and Feature Selection for CRF-Based Activity Recognition
Abstract—Due to their ability to model sequential data without making unnecessary independence assumptions, conditional random fields (CRFs) have become an increasingly popular ...
Liyue Zhao, Xi Wang, Gita Sukthankar
CORR
2012
Springer
235views Education» more  CORR 2012»
12 years 2 months ago
An Incremental Sampling-based Algorithm for Stochastic Optimal Control
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
Vu Anh Huynh, Sertac Karaman, Emilio Frazzoli
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
13 years 11 months ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
ALGOSENSORS
2009
Springer
13 years 4 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
INFOCOM
2005
IEEE
14 years 9 days ago
BARD: Bayesian-assisted resource discovery in sensor networks
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the mos...
Fred Stann, John S. Heidemann