Sciweavers

4112 search results - page 195 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
NIPS
2008
15 years 8 months ago
On the Efficient Minimization of Classification Calibrated Surrogates
Bartlett et al (2006) recently proved that a ground condition for convex surrogates, classification calibration, ties up the minimization of the surrogates and classification risk...
Richard Nock, Frank Nielsen
FUIN
2008
98views more  FUIN 2008»
15 years 6 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný
ALGORITHMICA
2010
107views more  ALGORITHMICA 2010»
15 years 6 months ago
A Universal Online Caching Algorithm Based on Pattern Matching
We present a universal algorithm for the classical online problem of caching or demand paging. We consider the caching problem when the page request sequence is drawn from an unkn...
Gopal Pandurangan, Wojciech Szpankowski
JMLR
2010
367views more  JMLR 2010»
15 years 1 months ago
Locally Linear Denoising on Image Manifolds
We study the problem of image denoising where images are assumed to be samples from low dimensional (sub)manifolds. We propose the algorithm of locally linear denoising. The algor...
Dian Gong, Fei Sha, Gérard G. Medioni
ICPR
2002
IEEE
16 years 7 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang