Sciweavers

2542 search results - page 379 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
EMMCVPR
2001
Springer
14 years 2 months ago
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
Yuri Boykov, Vladimir Kolmogorov
SIGGRAPH
2010
ACM
14 years 2 months ago
Reducing shading on GPUs using quad-fragment merging
Current GPUs perform a significant amount of redundant shading when surfaces are tessellated into small triangles. We address this inefficiency by augmenting the GPU pipeline to...
Kayvon Fatahalian, Solomon Boulos, James Hegarty, ...
SIGGRAPH
2010
ACM
14 years 2 months ago
Terrain-adaptive bipedal locomotion control
We describe a framework for the automatic synthesis of biped locomotion controllers that adapt to uneven terrain at run-time. The framework consists of two components: a per-foots...
Jia-chi Wu, Zoran Popovic
SCALESPACE
2001
Springer
14 years 2 months ago
Down-Scaling for Better Transform Compression
Abstract. The most popular lossy image compression method used on the Internet is the JPEG standard. JPEG’s good compression performance and low computational and memory complexi...
Alfred M. Bruckstein, Michael Elad, Ron Kimmel
HPCA
2000
IEEE
14 years 2 months ago
Design of a Parallel Vector Access Unit for SDRAM Memory Systems
We are attacking the memory bottleneck by building a “smart” memory controller that improves effective memory bandwidth, bus utilization, and cache efficiency by letting appl...
Binu K. Mathew, Sally A. McKee, John B. Carter, Al...