Sciweavers

1963 search results - page 228 / 393
» The Maximum Solution Problem on Graphs
Sort
View
101
Voted
ICCV
2007
IEEE
16 years 2 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
79
Voted
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 26 days ago
Picking up the Pieces: Self-Healing in Reconfigurable Networks
We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity...
Jared Saia, Amitabh Trehan
115
Voted
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 26 days ago
Modeling the structure and evolution of discussion cascades
We analyze the structure and evolution of discussion cascades in four popular websites: Slashdot, Barrapunto, Meneame and Wikipedia. Despite the big heterogeneities between these ...
Vicenç Gómez, Hilbert J. Kappen, And...
103
Voted
CIKM
2008
Springer
15 years 2 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han
ANOR
2004
170views more  ANOR 2004»
15 years 20 days ago
Graph Coloring for Air Traffic Flow Management
The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the airspace while satisfying Air Traffic Control constraints and airlines requests to optimize their o...
Nicolas Barnier, Pascal Brisset