Sciweavers

SIAMDM
2008
84views more  SIAMDM 2008»
13 years 4 months ago
Long Local Searches for Maximal Bipartite Subgraphs
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
Hemanshu Kaul, Douglas B. West
CORR
2010
Springer
48views Education» more  CORR 2010»
13 years 4 months ago
Stochastic Flips on Two-letter Words
This paper introduces a simple Markov process inspired by the problem of quasicrystal growth. It acts over two-letter words by randomly performing flips, a local transformation whi...
Olivier Bodini, Thomas Fernique, Damien Regnault
RAID
2005
Springer
13 years 9 months ago
FLIPS: Hybrid Adaptive Intrusion Prevention
Intrusion detection systems are fundamentally passive and fail–open. Because their primary task is classification, they do nothing to prevent an attack from succeeding. An intru...
Michael E. Locasto, Ke Wang, Angelos D. Keromytis,...