Sciweavers

3778 search results - page 519 / 756
» Representing Web Graphs
Sort
View
ISW
2004
Springer
15 years 10 months ago
Using Greedy Hamiltonian Call Paths to Detect Stack Smashing Attacks
The ICAT statistics over the past few years have shown at least one out of every five CVE and CVE candidate vulnerabilities have been due to buffer overflows. This constitutes a si...
Mark Foster, Joseph N. Wilson, Shigang Chen
VLDB
2004
ACM
93views Database» more  VLDB 2004»
15 years 10 months ago
Indexing Temporal XML Documents
Different models have been proposed recently for representing temporal data, tracking historical information, and recovering the state of the document as of any given time, in XM...
Alberto O. Mendelzon, Flavio Rizzolo, Alejandro A....
WLP
2004
Springer
15 years 10 months ago
Optimizing the Evaluation of XPath Using Description Logics
: The growing use of XML in commercial as well as non-commercial domains to transport information poses new challenges to concepts to access these information. Common ways to acces...
Peter Baumgartner, Ulrich Furbach, Margret Gro&szl...
CONCUR
2003
Springer
15 years 10 months ago
Priority Rewrite Systems for OSOS Process Languages
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
Irek Ulidowski
ESA
2003
Springer
124views Algorithms» more  ESA 2003»
15 years 10 months ago
The Minimum Generalized Vertex Cover Problem
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
Refael Hassin, Asaf Levin