Sciweavers

899 search results - page 113 / 180
» fast 2009
Sort
View
SC
2009
ACM
14 years 2 months ago
A framework for core-level modeling and design of reconfigurable computing algorithms
Reconfigurable computing (RC) is rapidly becoming a vital technology for many applications, from high-performance computing to embedded systems. The inherent advantages of custom-...
Gongyu Wang, Greg Stitt, Herman Lam, Alan D. Georg...
EGH
2009
Springer
13 years 8 months ago
Faster incoherent rays: Multi-BVH ray stream tracing
High fidelity rendering via ray tracing requires tracing incoherent rays for global illumination and other secondary effects. Recent research show that the performance benefits fr...
John A. Tsakok
CVPR
2009
IEEE
15 years 5 months ago
Efficient Planar Graph Cuts with Applications in Computer Vision
We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work [2] and leads to an efficient method that we apply on shape matching and im- a...
Daniel Cremers, Eno Töppe, Frank R. Schmidt
CVPR
2009
IEEE
15 years 5 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...
CVPR
2009
IEEE
1081views Computer Vision» more  CVPR 2009»
15 years 5 months ago
Learning Real-Time MRF Inference for Image Denoising
Many computer vision problems can be formulated in a Bayesian framework with Markov Random Field (MRF) or Conditional Random Field (CRF) priors. Usually, the model assumes that ...
Adrian Barbu (Florida State University)