1221 search results - page 24 / 245 » Balanced graph partitioning |
ICCV
2003
IEEE
14 years 10 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
IPPS
1999
IEEE
14 years 1 months ago
1999
IEEE
In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and appli...
ICIP
2002
IEEE
14 years 10 months ago
2002
IEEE
Recent interest in region based image coding has given rise to graph coloring based partition encoding methods. These methods are based on the four color theorem for planar graphs...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
ALGOSENSORS
2006
Springer
14 years 16 days ago
2006
Springer
Abstract. Motivated by the need for agent classification in sensor networking and autonomous vehicle control applications, we propose a flexible and distributed stochastic automato...