49 search results - page 3 / 10 » Dynamic Algorithm for Graph Clustering Using Minimum Cut Tre... |
CVPR
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
ALGORITHMICA
2004
13 years 7 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
ICMLA
2004
13 years 9 months ago
2004
Detecting outliers is an important topic in data mining. Sometimes the outliers are more interesting than the rest of the data. Outlier identification has lots of applications, su...
PAMI
2010
13 years 6 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...