Sciweavers

392 search results - page 30 / 79
» Reversal Complexity Revisited
Sort
View
IMC
2010
ACM
13 years 5 months ago
Revisiting the case for a minimalist approach for network flow monitoring
Network management applications require accurate estimates of a wide range of flow-level traffic metrics. Given the inadequacy of current packet-sampling-based solutions, several ...
Vyas Sekar, Michael K. Reiter, Hui Zhang
SIGDOC
1995
ACM
13 years 11 months ago
Personalized information structures II: hyperstructure hotlists
This paper describes ongoing research into the use of a domain-retargetable reverse engineering environment to aid the structural understanding of large information spaces. In par...
Scott R. Tilley, Walter M. Lamia
CCCG
2010
13 years 9 months ago
Zipper unfoldings of polyhedral complexes
We explore which polyhedra and polyhedral complexes can be formed by folding up a planar polygonal region and fastening it with one zipper. We call the reverse process a zipper un...
Anna Lubiw, Erik D. Demaine, Martin L. Demaine, Ar...
ECAI
2010
Springer
13 years 5 months ago
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
Rafael Peñaloza, Baris Sertkaya
VMCAI
2009
Springer
14 years 2 months ago
LTL Generalized Model Checking Revisited
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...
Patrice Godefroid, Nir Piterman