Sciweavers

12015 search results - page 2057 / 2403
» Interactive Algorithms 2005
Sort
View
JMIV
2007
83views more  JMIV 2007»
15 years 6 months ago
Minimization of a Detail-Preserving Regularization Functional for Impulse Noise Removal
Recently, a powerful two-phase method for restoring images corrupted with high level impulse noise has been developed. The main drawback of the method is the computational efficie...
Jian-Feng Cai, Raymond H. Chan, Carmine Di Fiore
FOCS
2009
IEEE
15 years 4 months ago
Learning and Smoothed Analysis
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua T...
CC
2010
Springer
120views System Software» more  CC 2010»
15 years 4 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
WEBI
2005
Springer
16 years 5 days ago
Page-reRank: Using Trusted Links to Re-Rank Authority
The basis of much of the intelligence on the Web is the hyperlink structure which represents an organising principle based on the human facility to be able to discriminate between...
Paolo Massa, Conor Hayes
CVPR
2007
IEEE
16 years 8 months ago
Robust Click-Point Linking: Matching Visually Dissimilar Local Regions
This paper presents robust click-point linking: a novel localized registration framework that allows users to interactively prescribe where the accuracy has to be high. By emphasi...
Kazunori Okada, Xiaolei Huang
« Prev « First page 2057 / 2403 Last » Next »