Sciweavers

1651 search results - page 198 / 331
» Measuring the Complexity of Classification Problems
Sort
View
IJCV
1998
153views more  IJCV 1998»
13 years 7 months ago
Rational Filters for Passive Depth from Defocus
A fundamental problem in depth from defocus is the measurement of relative defocus between images. The performance of previously proposed focus operators are inevitably sensitive t...
Masahiro Watanabe, Shree K. Nayar
ICIP
2010
IEEE
13 years 6 months ago
Non-rigid image registration by using graph-cuts with mutual information
Non-rigid image registration plays an important role in medical image analysis. Recently, Tang and Chung proposed to model the non-rigid medical image registration problem as an e...
Ronald W. K. So, Albert C. S. Chung
DSN
2011
IEEE
12 years 8 months ago
Modeling time correlation in passive network loss tomography
—We consider the problem of inferring link loss rates using passive measurements. Prior inference approaches are mainly built on the time correlation nature of packet losses. How...
Jin Cao, Aiyou Chen, Patrick P. C. Lee
APAL
2010
85views more  APAL 2010»
13 years 8 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
ICDE
2008
IEEE
103views Database» more  ICDE 2008»
14 years 9 months ago
Processing Diagnosis Queries: A Principled and Scalable Approach
Abstract-- Many popular Web sites suffer occasional uservisible problems such as slow responses, blank pages or error messages being displayed, items not being added to shopping ca...
Shivnath Babu, Songyun Duan, Kamesh Munagala