Sciweavers

648 search results - page 111 / 130
» A general dimension for query learning
Sort
View
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 9 months 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
IJCSA
2008
237views more  IJCSA 2008»
13 years 8 months ago
Development of A SOLAP Patrimony Management Application System: Fez Medina as a Case Study
It is well known that transactional and analytical systems each require different database architecture. In general, the database structure of transactional systems is optimized f...
I. Salam, M. El Mohajir, A. Taleb, B. El Mohajir
ECCC
2007
86views more  ECCC 2007»
13 years 8 months ago
Testing Halfspaces
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, R...
POPL
2010
ACM
14 years 6 months ago
Generating Compiler Optimizations from Proofs
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
Ross Tate, Michael Stepp, Sorin Lerner
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
14 years 3 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...