Sciweavers

100 search results - page 1 / 20
» Estimating the Average of a Lipschitz-Continuous Function fr...
Sort
View
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
14 years 3 days ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
ICDM
2009
IEEE
109views Data Mining» more  ICDM 2009»
14 years 5 months ago
Semi-naive Exploitation of One-Dependence Estimators
—It is well known that the key of Bayesian classifier learning is to balance the two important issues, that is, the exploration of attribute dependencies in high orders for ensu...
Nan Li, Yang Yu, Zhi-Hua Zhou
PODC
2005
ACM
14 years 4 months ago
Adaptive routing with stale information
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
Simon Fischer, Berthold Vöcking
TSP
2008
118views more  TSP 2008»
13 years 11 months ago
Approximating Functions From Sampled Fourier Data Using Spline Pseudofilters
Recently, new polynomial approximation formulas were proposed for the reconstruction of compactly supported piecewise smooth functions from Fourier data. Formulas for zero and firs...
Ana Gabriela Martínez, Alvaro R. De Pierro
SIGIR
2006
ACM
14 years 5 months ago
Inferring document relevance via average precision
We consider the problem of evaluating retrieval systems using a limited number of relevance judgments. Recent work has demonstrated that one can accurately estimate average precis...
Javed A. Aslam, Emine Yilmaz