Sciweavers

80 search results - page 5 / 16
» A fast cost scaling algorithm for submodular flow
Sort
View
VMV
2008
190views Visualization» more  VMV 2008»
13 years 9 months ago
GPU-Based Streamlines for Surface-Guided 3D Flow Visualization
Visualizing 3D flow fields intrinsically suffers from problems of clutter and occlusion. A common practice to alleviate these issues is to restrict the visualization to feature su...
Markus Üffinger, Thomas Klein, Magnus Strenge...
CVPR
2004
IEEE
14 years 9 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
DAC
2000
ACM
14 years 8 months ago
MINFLOTRANSIT: min-cost flow based transistor sizing tool
This paper presents MINFLOTRANSIT, a new transistor sizing tool for fast sizing of combinational circuits with minimal cost. MINFLOTRANSIT is an iterative relaxation based tool th...
Vijay Sundararajan, Sachin S. Sapatnekar, Keshab K...
BROADNETS
2007
IEEE
14 years 1 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
ALMOB
2008
131views more  ALMOB 2008»
13 years 7 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas