2520 search results - page 131 / 504 » The complexity of approximating entropy |
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
SI3D
2006
ACM
15 years 4 months ago
2006
ACM
We propose a real-time method for rendering rigid objects with complex view-dependent effects under distant all-frequency lighting. Existing precomputed light transport approaches...
145
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
Restoring a clear image from a single motion-blurred
image due to camera shake has long been a challenging
problem in digital imaging. Existing blind deblurring techniques
eithe...
100
click to vote
COMPUTING
2008
14 years 10 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
ICIP
2002
IEEE
16 years 4 days ago
2002
IEEE
In this paper, we consider the problem of lossless compression of video by taking into account temporal information. Video lossless compression is an interesting possibility in th...