Sciweavers

4110 search results - page 415 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
JPDC
2006
187views more  JPDC 2006»
15 years 6 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu
GLOBECOM
2010
IEEE
15 years 4 months ago
Finding and Mending Barrier Gaps in Wireless Sensor Networks
Constructing sensing barriers using wireless sensor networks has important applications in military operations and homeland security. The goal of forming a sensing barrier is to de...
Anwar Saipulla, Benyuan Liu, Jie Wang
ICPR
2010
IEEE
15 years 4 months ago
Cascaded Background Subtraction Using Block-Based and Pixel-Based Codebooks
This paper presents a cascaded scheme with block-based and pixel-based codebooks for background subtraction. The codebook is mainly used to compress information to achieve high ef...
Jing-Ming Guo, Chih-Sheng Hsu
RECOMB
2007
Springer
16 years 7 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
UAI
2008
15 years 8 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...