Sciweavers

569 search results - page 44 / 114
» Online Bounds for Bayesian Algorithms
Sort
View
WSDM
2010
ACM
365views Data Mining» more  WSDM 2010»
15 years 7 months ago
A Novel Click Model and Its Applications to Online Advertising
Recent advances in click model have positioned it as an attractive method for representing user preferences in web search and online advertising. Yet, most of the existing works f...
Zeyuan Allen Zhu, Weizhu Chen, Tom Minka, Chenguan...
PAMI
1998
100views more  PAMI 1998»
14 years 9 months ago
Hilbert-Schmidt Lower Bounds for Estimators on Matrix Lie Groups for ATR
—Deformable template representations of observed imagery, model the variability of target pose via the actions of the matrix Lie groups on rigid templates. In this paper, we stud...
Ulf Grenander, Michael I. Miller, Anuj Srivastava
MFCS
2001
Springer
15 years 2 months ago
News from the Online Traveling Repairman
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
Sven Oliver Krumke, Willem de Paepe, Diana Poensge...
CVPR
2011
IEEE
14 years 6 months ago
Natural Image Denoising: Optimality and Inherent Bounds
The goal of natural image denoising is to estimate a clean version of a given noisy image, utilizing prior knowledge on the statistics of natural images. The problem has been stud...
Anat Levin, Boaz Nadler
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir