543 search results - page 89 / 109 » A Multiagent Algorithm for Graph Partitioning |
ECCV
2010
Springer
13 years 8 months ago
2010
Springer
Many methods for object recognition, segmentation, etc., rely on tessellation of an image into "superpixels". A superpixel is an image patch which is better aligned with ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
HICSS
2007
IEEE
14 years 2 months ago
2007
IEEE
In these days, companies need highly flexible processes to deal with changing environments and competitors. Using traditional process models that have to be modeled in all detail...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
PR
2008
13 years 7 months ago
2008
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...