Sciweavers

3096 search results - page 313 / 620
» The Generalized FITC Approximation
Sort
View
WSDM
2009
ACM
131views Data Mining» more  WSDM 2009»
16 years 1 months ago
Diversifying search results
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverso...
SIGECOM
2009
ACM
139views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
Simple versus optimal mechanisms
The monopolist’s theory of optimal single-item auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optim...
Jason D. Hartline, Tim Roughgarden
GIS
2006
ACM
15 years 6 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
16 years 6 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
ESA
2009
Springer
156views Algorithms» more  ESA 2009»
16 years 1 months ago
On Revenue Maximization in Second-Price Ad Auctions
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, ...