Sciweavers

332 search results - page 28 / 67
» Parameterized Graph Separation Problems
Sort
View
BROADNETS
2007
IEEE
14 years 2 months ago
Strategic deployment of network monitors for attack attribution
—Attacks launched over the Internet have become a pressing problem. Attackers make use of a variety of techniques to anonymize their traffic, in order to escape detection and pr...
Young June Pyun, Douglas S. Reeves
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 6 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
TCS
2010
13 years 6 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
GPCE
2008
Springer
13 years 9 months ago
Lightweight dependent classes
Extensive research efforts have been devoted to implement a group of type-safe mutually recursive classes; recently, proposals for separating each member of the group as a reusabl...
Tetsuo Kamina, Tetsuo Tamai
SIGDOC
2000
ACM
14 years 24 days ago
Making complex document structures accessible through templates
We address two problems of technical authors in structured environments: (1) Structure definitions of the SGML school are limiting: they require one primary hierarchy and do not c...
Felix H. Gatzemeier, Oliver Meyer