133 search results - page 20 / 27 » Approximate Hypergraph Partitioning and Applications |
KDD
2012
ACM
11 years 10 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
ICDCS
2007
IEEE
14 years 1 months ago
2007
IEEE
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
EMMCVPR
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
PERVASIVE
2011
Springer
12 years 10 months ago
2011
Springer
As location-sensing smart phones and location-based services gain mainstream popularity, there is increased interest in developing techniques that can detect anomalous activities. ...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...