Sciweavers

460 search results - page 89 / 92
» Bounding the locality of distributed routing algorithms
Sort
View
FPGA
2004
ACM
163views FPGA» more  FPGA 2004»
13 years 11 months ago
Time and area efficient pattern matching on FPGAs
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
Zachary K. Baker, Viktor K. Prasanna
ICPADS
2005
IEEE
14 years 1 months ago
A Two-Level Strategy for Topology Control in Wireless Sensor Networks
— This paper presents a two-level strategy for topology control in wireless sensor networks. The energy saving methods in most of the existing research work can be categorized in...
Bolian Yin, Hongchi Shi, Yi Shang
STOC
2009
ACM
150views Algorithms» more  STOC 2009»
14 years 8 months ago
Integrality gaps for Sherali-Adams relaxations
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
Moses Charikar, Konstantin Makarychev, Yury Makary...
MOBIHOC
2005
ACM
14 years 7 months ago
Power balanced coverage-time optimization for clustered wireless sensor networks
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
Tao Shu, Marwan Krunz, Sarma B. K. Vrudhula
ISRR
2005
Springer
118views Robotics» more  ISRR 2005»
14 years 1 months ago
A Provably Consistent Method for Imposing Sparsity in Feature-Based SLAM Information Filters
An open problem in Simultaneous Localization and Mapping (SLAM) is the development of algorithms which scale with the size of the environment. A few promising methods exploit the ...
Matthew Walter, Ryan Eustice, John J. Leonard