454 search results - page 34 / 91 » Segmented Iterators and Hierarchical Algorithms |
77
Voted
CVPR
2006
IEEE
15 years 11 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...
CGF
1998
14 years 9 months ago
1998
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...
SCALESPACE
2009
Springer
15 years 4 months ago
2009
Springer
We present a fast edge-preserving cascadic multilevel image restoration method for reducing blur and noise in contaminated images. The method also can be applied to segmentation. O...
CIKM
2004
Springer
15 years 3 months ago
2004
Springer
It is crucial in many information systems to organize short text segments, such as keywords in documents and queries from users, into a well-formed topic hierarchy. In this paper,...
108
click to vote
SOFSEM
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...