Sciweavers

1478 search results - page 272 / 296
» Modular Complexity Analysis via Relative Complexity
Sort
View
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 8 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
VLDB
2007
ACM
104views Database» more  VLDB 2007»
14 years 8 months ago
Extending Dependencies with Conditions
This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related ...
Loreto Bravo, Wenfei Fan, Shuai Ma
VMCAI
2009
Springer
14 years 2 months ago
A Scalable Memory Model for Low-Level Code
Abstract. Because of its critical importance underlying all other software, lowlevel system software is among the most important targets for formal verification. Low-level systems...
Zvonimir Rakamaric, Alan J. Hu
VIZSEC
2007
Springer
14 years 1 months ago
An Interactive Attack Graph Cascade and Reachability Display
Abstract Attack graphs for large enterprise networks improve security by revealing critical paths used by adversaries to capture network assets. Even with simplification, current a...
Leevar Williams, Richard Lippmann, Kyle Ingols
INFOCOM
2006
IEEE
14 years 1 months ago
Integrated Intermediate Waveband and Wavelength Switching for Optical WDM Mesh Networks
— As wavelength-division multiplexing (WDM) evolves towards practical applications in optical transport networks, waveband switching (WBS) has been introduced to cut down the ope...
Mengke Li, Byrav Ramamurthy