332 search results - page 21 / 67 » Complexity analysis of a decentralised graph colouring algor... |
173
click to vote
DAGSTUHL
1996
15 years 6 months ago
1996
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
158
click to vote
ACSAC
2005
IEEE
15 years 10 months ago
2005
IEEE
The typical means by which an attacker breaks into a network is through a chain of exploits, where each exploit in the chain lays the groundwork for subsequent exploits. Such a ch...
183
click to vote
PODC
2010
ACM
15 years 9 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
174
click to vote
BMCBI
2010
2010
Discover Protein Complexes in Protein-Protein Interaction Networks Using Parametric Local Modularity
15 years 5 months ago
Background: Recent advances in proteomic technologies have enabled us to create detailed protein-protein interaction maps in multiple species and in both normal and diseased cells...
161
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Abstract: We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algori...