Sciweavers

2127 search results - page 17 / 426
» Computing large matchings fast
Sort
View
CGF
2010
148views more  CGF 2010»
13 years 7 months ago
Two Methods for Fast Ray-Cast Ambient Occlusion
Ambient occlusion has proven to be a useful tool for producing realistic images, both in offline rendering and interactive applications. In production rendering, ambient occlusion...
Samuli Laine, Tero Karras
CVPR
2010
IEEE
13 years 6 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
EMNLP
2009
13 years 5 months ago
Fast Translation Rule Matching for Syntax-based Statistical Machine Translation
In a linguistically-motivated syntax-based translation system, the entire translation process is normally carried out in two steps, translation rule matching and target sentence d...
Hui Zhang, Min Zhang, Haizhou Li, Chew Lim Tan
MM
2006
ACM
180views Multimedia» more  MM 2006»
14 years 1 months ago
Fast tracking of near-duplicate keyframes in broadcast domain with transitivity propagation
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...
Chong-Wah Ngo, Wanlei Zhao, Yu-Gang Jiang
ACCV
2010
Springer
13 years 2 months ago
Four Color Theorem for Fast Early Vision
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
Radu Timofte, Luc J. Van Gool