Sciweavers

167 search results - page 23 / 34
» On the complexity and approximation of syntenic distance
Sort
View
ICIP
2005
IEEE
14 years 9 months ago
Advances in recursive per-pixel estimation of end-to-end distortion for application in H.264
This paper is concerned with open questions and modifications to expand the applicability of the recursive optimal per-pixel estimate (ROPE) of end-to-end distortion, which are pa...
Hua Yang, Kenneth Rose
SMA
2006
ACM
132views Solid Modeling» more  SMA 2006»
14 years 1 months ago
Generalized penetration depth computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
RSS
2007
134views Robotics» more  RSS 2007»
13 years 9 months ago
A Fast and Practical Algorithm for Generalized Penetration Depth Computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Dinesh Manocha
CGVR
2006
13 years 9 months ago
Real-time Computation of Area Shadows - A Geometrical Algorithm
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
Michael Boehl, Wolfgang Stürzlinger
UAI
2000
13 years 9 months ago
Adaptive Importance Sampling for Estimation in Structured Domains
Sampling is an important tool for estimating large, complex sums and integrals over highdimensional spaces. For instance, importance sampling has been used as an alternative to ex...
Luis E. Ortiz, Leslie Pack Kaelbling