181 search results - page 24 / 37 » Fast Approximate Graph Partitioning Algorithms |
134
click to vote
CGF
1999
15 years 1 months ago
1999
Direct volume rendering based on projective methods works by projecting, in visibility order, the polyhedral cells of a mesh onto the image plane, and incrementally compositing th...
120
click to vote
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
101
click to vote
IPL
2002
15 years 1 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
142
Voted
CIKM
2010
Springer
15 years 23 days ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
119
Voted
CVPR
2004
IEEE
16 years 4 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...