Sciweavers

495 search results - page 86 / 99
» Approximation algorithms for budgeted learning problems
Sort
View
CVPR
2012
IEEE
11 years 9 months ago
Image denoising: Can plain neural networks compete with BM3D?
Image denoising can be described as the problem of mapping from a noisy image to a noise-free image. The best currently available denoising methods approximate this mapping with c...
Harold Christopher Burger, Christian J. Schuler, S...
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
14 years 7 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
ECML
2006
Springer
13 years 11 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 7 months ago
Structure-Aware Stochastic Control for Transmission Scheduling
In this report, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decisio...
Fangwen Fu, Mihaela van der Schaar
ICML
2008
IEEE
14 years 8 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash