Sciweavers

7930 search results - page 1200 / 1586
» Greedy in Approximation Algorithms
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
Surface Coverage in Wireless Sensor Networks
—Coverage is a fundamental problem in Wireless Sensor Networks (WSNs). Existing studies on this topic focus on 2D ideal plane coverage and 3D full space coverage. In many real wo...
Ming-Chen Zhao, Jiayin Lei, Min-You Wu, Yunhuai Li...
IPPS
2008
IEEE
16 years 1 months ago
Sweep coverage with mobile sensors
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
Wei-Fang Cheng, Mo Li, Kebin Liu, Yunhao Liu, Xian...
ATAL
2007
Springer
16 years 28 days ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...
CVPR
2006
IEEE
16 years 24 days ago
Measure Locally, Reason Globally: Occlusion-sensitive Articulated Pose Estimation
Part-based tree-structured models have been widely used for 2D articulated human pose-estimation. These approaches admit efficient inference algorithms while capturing the import...
Leonid Sigal, Michael J. Black
MM
2005
ACM
215views Multimedia» more  MM 2005»
16 years 9 days ago
OpenVIDIA: parallel GPU computer vision
Graphics and vision are approximate inverses of each other: ordinarily Graphics Processing Units (GPUs) are used to convert “numbers into pictures” (i.e. computer graphics). I...
James Fung, Steve Mann
« Prev « First page 1200 / 1586 Last » Next »