1221 search results - page 115 / 245 » Balanced graph partitioning |
ENDM
2000
13 years 10 months ago
2000
A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets AL; AR; SL and SR such that: every vertex of AL is adjacent to every vertex of AR; no ...
105
click to vote
GIS
2004
ACM
14 years 11 months ago
2004
ACM
This paper presents a fast algorithm for smooth digital elevation model interpolation and approximation from scattered elevation data. The global surface is reconstructed by subdi...
MICRO
2000
IEEE
14 years 2 months ago
2000
IEEE
In this work we show that value prediction can be used to avoid the penalty of long wire delays by predicting the data that is communicated through these long wires and validating...
DAM
2007
13 years 10 months ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
ACCV
2009
Springer
14 years 4 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...