967 search results - page 118 / 194 » On the efficiency of adaptive MCMC algorithms |
CSR
2006
Springer
15 years 3 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
110
click to vote
CGF
2008
14 years 12 months ago
2008
We present a real-time rendering algorithm for inhomogeneous, single scattering media, where all-frequency shading effects such as glows, light shafts, and volumetric shadows can ...
JDA
2008
14 years 11 months ago
2008
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
111
click to vote
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
Detection of visually salient image regions is useful for
applications like object segmentation, adaptive compression,
and object recognition. In this paper, we introduce
a meth...
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Many computer vision algorithms make use of local features, and rely on a systematic comparison of these features. The chosen dissimilarity measure is of crucial importance for th...