49 search results - page 2 / 10 » Dynamic Algorithm for Graph Clustering Using Minimum Cut Tre... |
101
click to vote
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
106
click to vote
ICPR
2004
IEEE
16 years 3 months ago
2004
IEEE
This paper is concerned with the problem of dynamically reconstructing the 3D surface of an object undergoing non-rigid motion. The problem is cast as reconstructing a continuous ...
100
click to vote
WWW
2008
ACM
16 years 2 months ago
2008
ACM
The paper is concerned with the problem of question recommendation. Specifically, given a question as query, we are to retrieve and rank other questions according to their likelih...
PG
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...