335 search results - page 29 / 67 » High quality graph partitioning |
118
Voted
VCIP
2000
15 years 2 months ago
2000
This paper introduces some preliminary results of the standardization process of ITU-T's H.26L project. This forthcoming video coding standard will not only significantly imp...
92
Voted
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
107
Voted
CVPR
2006
IEEE
16 years 2 months ago
2006
IEEE
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...
119
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
113
Voted
ICDCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We consider distributed applications that continuously stream data across the network, where data needs to be aggregated and processed to produce a 'useful' stream of up...