Sciweavers

659 search results - page 54 / 132
» Dynamic Algorithms for Graph Spanners
Sort
View
IEEEARES
2009
IEEE
14 years 2 months ago
A Mobile Ambients-Based Approach for Network Attack Modelling and Simulation
Abstract—Attack Graphs are an important support for assessment and subsequent improvement of network security. They reveal possible paths an attacker can take to break through se...
Virginia N. L. Franqueira, Pascal van Eck, Roel Wi...
BIBE
2007
IEEE
114views Bioinformatics» more  BIBE 2007»
14 years 2 months ago
A Hierarchical Grow-and-Match Algorithm for Backbone Resonance Assignments Given 3D Structure
Abstract—This paper develops an algorithm for NMR backbone resonance assignment given a 3D structure and a set of relatively sparse 15 N-edited NMR data, with the through-space 1...
Fei Xiong, Chris Bailey-Kellogg
ICDM
2006
IEEE
147views Data Mining» more  ICDM 2006»
14 years 1 months ago
Adaptive Parallel Graph Mining for CMP Architectures
Mining graph data is an increasingly popular challenge, which has practical applications in many areas, including molecular substructure discovery, web link analysis, fraud detect...
Gregory Buehrer, Srinivasan Parthasarathy, Yen-Kua...

Publication
592views
15 years 4 months ago
Coupling Graph Cuts and Level Sets
"This paper presents an efficient algorithm for solving one sort of region-based active contour models, i.e. the active contours without edges model. We develop the link betwe...
Xiang Zeng, Wei Chen, and Qunsheng Peng
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
14 years 5 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson