232 search results - page 7 / 47 » Dynamic Graph Clustering Using Minimum-Cut Trees |
IPCV
2008
13 years 8 months ago
2008
Minimum spanning tree algorithms have been proposed for the lossy compression of image sets. In these algorithms, a complete graph is constructed from the entire image set and an ...
ICIP
2006
IEEE
14 years 22 days ago
2006
IEEE
This paper introduces a new visual representation of a document or group of documents, a Dynamic Document Icon, or Dydocon. Its representation is symbolic like an icon, but change...
ASUNAM
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper we present an application of our incremental graph clustering algorithm (DENGRAPH) on a data set obtained from the music community site Last.fm. The aim of our study...
ALGORITHMICA
2004
13 years 6 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...
IDEAL
2009
Springer
13 years 11 months ago
2009
Springer
With the rapid and dramatic increase in web feeds published by different publishers, providers or websites via Really Simple Syndication (RSS) and Atom, users cannot be expected t...