230 search results - page 41 / 46 » Minimum Spanning Tree Problem with Label Selection |
COMPGEOM
2006
ACM
14 years 13 days ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
IROS
2007
IEEE
14 years 3 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...