Sciweavers

1542 search results - page 176 / 309
» Kernelization of packing problems
Sort
View
JCSS
2007
89views more  JCSS 2007»
15 years 1 months ago
The relative worst-order ratio applied to paging
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition ...
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
TIP
2010
155views more  TIP 2010»
15 years 5 days ago
Is Denoising Dead?
—Image denoising has been a well studied problem in the field of image processing. Yet researchers continue to focus attention on it to better the current state-of-the-art. Rece...
Priyam Chatterjee, Peyman Milanfar
KDD
2012
ACM
292views Data Mining» more  KDD 2012»
13 years 4 months ago
Online allocation of display ads with smooth delivery
Display ads on the Internet are often sold in bundles of thousands or millions of impressions over a particular time period, typically weeks or months. Ad serving systems that ass...
Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni
ICML
2009
IEEE
16 years 2 months ago
A simpler unified analysis of budget perceptrons
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...
Ilya Sutskever
98
Voted
ICASSP
2009
IEEE
15 years 8 months ago
Sampling signals with finite rate of innovation in the presence of noise
Recently, it has been shown that it is possible to sample non-bandlimited signals that possess a limited number of degrees of freedom and uniquely reconstruct them from a finite ...
Pier Luigi Dragotti, Felix Homann