Sciweavers

3533 search results - page 184 / 707
» Locally Optimized RANSAC
Sort
View
JSAC
2008
140views more  JSAC 2008»
15 years 6 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
CVPR
2005
IEEE
16 years 8 months ago
Local Color Transfer via Probabilistic Segmentation by Expectation-Maximization
We address the problem of regional color transfer between two natural images by probabilistic segmentation. We use a new Expectation-Maximization (EM) scheme to impose both spatia...
Yu-Wing Tai, Jiaya Jia, Chi-Keung Tang
SLS
2009
Springer
224views Algorithms» more  SLS 2009»
16 years 1 months ago
High-Performance Local Search for Solving Real-Life Inventory Routing Problems
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
Thierry Benoist, Bertrand Estellon, Fréd&ea...
INFOCOM
2006
IEEE
16 years 17 days ago
A Power-Saving Multi-Radio Multi-Channel MAC Protocol for Wireless Local Area Networks
— Opportunistic spectrum access and adaptive power management are effective techniques to improve throughput, delay performance, and energy efficiency for wireless networks. In ...
Jianfeng Wang, Yuguang Fang, Dapeng Oliver Wu
PODC
2005
ACM
16 years 3 days ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer