Sciweavers

32 search results - page 4 / 7
» Maintaining a large matching and a small vertex cover
Sort
View
IMC
2006
ACM
14 years 1 months ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...
CSMR
1998
IEEE
13 years 11 months ago
Assessing Architectural Complexity
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our ap...
Rick Kazman, M. Burth
VLDB
2004
ACM
111views Database» more  VLDB 2004»
14 years 24 days ago
A Framework for Using Materialized XPath Views in XML Query Processing
XML languages, such as XQuery, XSLT and SQL/XML, employ XPath as the search and extraction language. XPath expressions often define complicated navigation, resulting in expensive...
Andrey Balmin, Fatma Özcan, Kevin S. Beyer, R...
ICDCN
2011
Springer
12 years 11 months ago
Reliable Networks with Unreliable Sensors
Abstract. Wireless sensor networks (WSNs) deployed in hostile environments suffer from a high rate of node failure. We investigate the effect of such failure rate on network conn...
Srikanth Sastry, Tsvetomira Radeva, Jianer Chen, J...
INFOCOM
2003
IEEE
14 years 22 days ago
Unreliable Sensor Grids: Coverage, Connectivity and Diameter
Abstract— We consider an unreliable wireless sensor gridnetwork with n nodes placed in a square of unit area. We are interested in the coverage of the region and the connectivity...
Sanjay Shakkottai, R. Srikant, Ness B. Shroff