Sciweavers

724 search results - page 18 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
CVPR
2007
IEEE
16 years 1 months ago
Graph Cut Based Optimization for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
Olga Veksler
ISLPED
2005
ACM
102views Hardware» more  ISLPED 2005»
15 years 5 months ago
Snug set-associative caches: reducing leakage power while improving performance
As transistors keep shrinking and on-chip data caches keep growing, static power dissipation due to leakage of caches takes an increasing fraction of total power in processors. Se...
Jia-Jhe Li, Yuan-Shin Hwang
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
14 years 12 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
CVPR
2004
IEEE
16 years 1 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
WIOPT
2005
IEEE
15 years 5 months ago
Iterated Local Optimization for Minimum Energy Broadcast
In our prior work, we presented a highly effective local search based heuristic algorithm called the Largest Expanding Sweep Search (LESS) to solve the minimum energy broadcast (M...
Intae Kang, Radha Poovendran