Sciweavers

1082 search results - page 49 / 217
» Approximation Algorithms for Spreading Points
Sort
View
ICPR
2008
IEEE
14 years 8 months ago
A new approach to 3D shape recovery of local planar surface patches from shift-variant blurred images
A new approach is presented for 3D shape recovery of local planar surface patches from two shift/spacevariant defocused images. It is based on a recently proposed technique for in...
Murali Subbarao, Xue Tu, Youn-sik Kang
DPHOTO
2010
195views Hardware» more  DPHOTO 2010»
13 years 9 months ago
Direct PSF estimation using a random noise target
Conventional point spread function (PSF) measurement methods often use parametric models for the estimation of the PSF. This limits the shape of the PSF to a specific form provide...
Johannes Brauers, Claude Seiler, Til Aach
TSMC
2010
13 years 2 months ago
Incomplete Multigranulation Rough Set
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of...
Yuhua Qian, Jiye Liang, Chuangyin Dang
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 8 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
ICDE
1996
IEEE
142views Database» more  ICDE 1996»
14 years 9 months ago
Approximate Queries and Representations for Large Data Sequences
Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation ...
Hagit Shatkay, Stanley B. Zdonik