Sciweavers

4110 search results - page 255 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
AINA
2005
IEEE
16 years 6 days ago
Optimal Energy-Efficient Routing for Wireless Sensor Networks
The network lifetime for wireless sensor network plays an important role to survivability. Thus, we indicate the importance of routing protocol to network lifetime, and model the ...
Chih-Wei Shiou, Frank Yeong-Sung Lin, Hsu-Chen Che...
ECCV
2008
Springer
16 years 8 months ago
Deformed Lattice Discovery Via Efficient Mean-Shift Belief Propagation
We introduce a novel framework for automatic detection of repeated patterns in real images. The novelty of our work is to formulate the extraction of an underlying deformed lattice...
Minwoo Park, Robert T. Collins, Yanxi Liu
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 6 months ago
Polynomial Linear Programming with Gaussian Belief Propagation
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 6 months ago
Generating Random Graphs with Large Girth
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
Mohsen Bayati, Andrea Montanari, Amin Saberi
VTC
2008
IEEE
224views Communications» more  VTC 2008»
16 years 29 days ago
Dynamic Spectrum Allocation in Wireless Cognitive Sensor Networks: Improving Fairness and Energy Efficiency
Abstract- This paper considers the centralized spectrum allocations in resource-constrained wireless sensor networks with the following goals: (1) allocate spectrum as fairly as po...
Sang-Seon Byun, Ilangko Balasingham, Xuedong Liang