Sciweavers

316 search results - page 40 / 64
» On Approximate Majority and Probabilistic Time
Sort
View
COMCOM
2007
103views more  COMCOM 2007»
14 years 9 months ago
Using event detection latency to evaluate the coverage of a wireless sensor network
A wireless sensor network (WSN) consists of many tiny and low-power devices deployed in a sensing field. One of the major tasks of a WSN is to monitor the surrounding environment...
You-Chiun Wang, Kai-Yang Cheng, Yu-Chee Tseng
CORR
2008
Springer
131views Education» more  CORR 2008»
14 years 9 months ago
Towards a More Accurate Carrier Sensing Model for CSMA Wireless Networks
Abstract--In the majority of studies on CSMA wireless networks, a contention graph is used to model the carrier sensing relationships among links. This is a 0-1 model in which two ...
Caihong Kai, Soung Chang Liew
MVA
2007
179views Computer Vision» more  MVA 2007»
14 years 9 months ago
Multi-object trajectory tracking
The majority of existing tracking algorithms are based on the maximum a posteriori (MAP) solution of a probabilistic framework using a Hidden Markov Model, where the distribution ...
Mei Han, Wei Xu, Hai Tao, Yihong Gong
75
Voted
IROS
2007
IEEE
131views Robotics» more  IROS 2007»
15 years 4 months ago
A hybrid approach for complete motion planning
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
Liangjun Zhang, Young J. Kim, Dinesh Manocha
SLIP
2006
ACM
15 years 3 months ago
Statistical crosstalk aggressor alignment aware interconnect delay calculation
Crosstalk aggressor alignment induces significant interconnect delay variation and needs to be taken into account in a statistical timer. In this paper, we approximate crosstalk ...
Andrew B. Kahng, Bao Liu, Xu Xu