2314 search results - page 93 / 463 » Minimal Partitions of a Graph |
166
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
180
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
137
Voted
GD
2007
Springer
16 years 9 days ago
2007
Springer
We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced b...
144
click to vote
ASPDAC
1999
ACM
15 years 10 months ago
1999
ACM
The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mappe...
155
click to vote
ICCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The divisive MinMaxCut algorithm of Ding et al. [3] produces more accurate clustering results than existing document cluster methods. Multilevel algorithms [4, 1, 5, 7] h...