Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Nagarajan, Chandrashekhar"'
Autor:
Nagarajan, Chandrashekhar
Publikováno v:
Connect to full text. Access to electronic version of some theses may be restricted..
Thesis (Ph.D.)--Cornell University, Jan. 2009.
Includes bibliographical references.
Includes bibliographical references.
Externí odkaz:
http://hdl.handle.net/1813/11387
Autor:
Bharadwaj, Vijay, Chen, Peiji, Ma, Wenjing, Nagarajan, Chandrashekhar, Tomlin, John, Vassilvitskii, Sergei, Vee, Erik, Yang, Jian
Motivated by the problem of optimizing allocation in guaranteed display advertising, we develop an efficient, lightweight method of generating a compact {\em allocation plan} that can be used to guide ad server decisions. The plan itself uses just O(
Externí odkaz:
http://arxiv.org/abs/1203.3619
Autor:
Chen, Peiji, Ma, Wenjing, Mandalapu, Srinath, Nagarajan, Chandrashekhar, Shanmugasundaram, Jayavel, Vassilvitskii, Sergei, Vee, Erik, Yu, Manfai, Zien, Jason
A large fraction of online display advertising is sold via guaranteed contracts: a publisher guarantees to the advertiser a certain number of user visits satisfying the targeting predicates of the contract. The publisher is then tasked with solving t
Externí odkaz:
http://arxiv.org/abs/1203.3593
Publikováno v:
In Discrete Optimization November 2013 10(4):361-370
Autor:
Bharadwaj, Vijay, Chen, Peiji, Ma, Wenjing, Nagarajan, Chandrashekhar, Tomlin, John, Vassilvitskii, Sergei, Vee, Erik, Yang, Jian
Publikováno v:
Proceedings of the 18th ACM SIGKDD International Conference Knowledge Discovery & Data Mining; 8/12/2012, p1195-1203, 9p
Autor:
Peiji Chen, Wenjingma, Mandalapu, Srinath, Nagarajan, Chandrashekhar, Shanmugasundaram, Jayavel, Vassilvitskii, Sergei, Erik Vee, Manfai Yu, Jason Zien
Publikováno v:
EC: Electronic Commerce; 2012, p319-336, 18p, 4 Diagrams, 6 Charts, 1 Graph
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Approximation & Online Algorithms (9783540939795); 2009, p174-187, 14p
Publikováno v:
Integer Programming & Combinatorial Optimization (9783540688860); 2008, p303-315, 13p
Publikováno v:
Proceedings of the Ninth International Conference: Electronic Commerce; 8/19/2007, p351-360, 10p