Sciweavers

2492 search results - page 36 / 499
» On the General Signature Trees
Sort
View
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 8 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
ENTCS
2008
114views more  ENTCS 2008»
13 years 7 months ago
Term-graph Rewriting in Tom Using Relative Positions
In this paper, we present the implementation in Tom of a de Bruijn indices generalization allowing the representation of term-graphs over an algebraic signature. By adding pattern...
Emilie Balland, Paul Brauner
CCS
2003
ACM
14 years 25 days ago
Enhancing byte-level network intrusion detection signatures with context
Many network intrusion detection systems (NIDS) use byte sequences as signatures to detect malicious activity. While being highly efficient, they tend to suffer from a high false...
Robin Sommer, Vern Paxson
ICNP
1998
IEEE
13 years 12 months ago
Digital Signatures for Flows and Multicasts
We present chaining techniques for signing/verifying multiple packets using a single signing/verification operation. We then present flow signing and verification procedures based...
Chung Kei Wong, Simon S. Lam
ACSAC
2008
IEEE
14 years 2 months ago
Execution Trace-Driven Automated Attack Signature Generation
In its most general form, an attack signature is a program that can correctly determine if an input network packet sequence can successfully attack a protected network application...
Susanta Nanda, Tzi-cker Chiueh