Sciweavers

1651 search results - page 220 / 331
» Measuring the Complexity of Classification Problems
Sort
View
FCSC
2010
238views more  FCSC 2010»
13 years 5 months ago
Knowledge discovery through directed probabilistic topic models: a survey
Graphical models have become the basic framework for topic based probabilistic modeling. Especially models with latent variables have proved to be effective in capturing hidden str...
Ali Daud, Juanzi Li, Lizhu Zhou, Faqir Muhammad
FOCM
2002
140views more  FOCM 2002»
13 years 8 months ago
Adaptive Wavelet Methods II - Beyond the Elliptic Case
This paper is concerned with the design and analysis of adaptive wavelet methods for systems of operator equations. Its main accomplishment is to extend the range of applicability...
Albert Cohen, Wolfgang Dahmen, Ronald A. DeVore
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 1 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
CVPR
2003
IEEE
14 years 10 months ago
Motion Deblurring Using Hybrid Imaging
Motion blur due to camera motion can significantly degrade the quality of an image. Since the path of the camera motion can be arbitrary, deblurring of motion blurred images is a ...
Moshe Ben-Ezra, Shree K. Nayar
COLT
2005
Springer
14 years 1 months ago
Learnability of Bipartite Ranking Functions
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
Shivani Agarwal, Dan Roth