51 search results - page 6 / 11 » Clustering by weighted cuts in directed graphs |
JPDC
2007
13 years 7 months ago
2007
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
TCSV
2008
13 years 7 months ago
2008
This paper presents a graphical model for learning and recognizing human actions. Specifically, we propose to encode actions in a weighted directed graph, referred to as action gra...
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
We consider spectral clustering and transductive inference for data with multiple views. A typical example is the web, which can be described by either the hyperlinks between web ...
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...