default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShengjun Pan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c20]Wei Zhang, Brendan Kitts, Yanjun Han, Zhengyuan Zhou, Tingyu Mao, Hao He, Shengjun Pan, Aaron Flores, San Gultekin, Tsachy Weissman:
MEOW: A Space-Efficient Nonparametric Bid Shading Algorithm. KDD 2021: 3928-3936- [c19]Tian Zhou, Hao He, Shengjun Pan, Niklas Karlsson
, Bharatbhushan Shetty, Brendan Kitts, Djordje Gligorijevic, San Gultekin, Tingyu Mao, Junwei Pan, Jianlong Zhang, Aaron Flores:
An Efficient Deep Distribution Network for Bid Shading in First-Price Auctions. KDD 2021: 3996-4004 - [i5]Tian Zhou, Hao He, Shengjun Pan, Niklas Karlsson, Bharatbhushan Shetty, Brendan Kitts, Djordje Gligorijevic, San Gultekin, Tingyu Mao, Junwei Pan, Jianlong Zhang, Aaron Flores:
An Efficient Deep Distribution Network for Bid Shading in First-Price Auctions. CoRR abs/2107.06650 (2021) - 2020
- [c18]Djordje Gligorijevic, Tian Zhou, Bharatbhushan Shetty, Brendan Kitts, Shengjun Pan, Junwei Pan, Aaron Flores:
Bid Shading in The Brave New World of First-Price Auctions. CIKM 2020: 2453-2460 - [i4]Djordje Gligorijevic, Tian Zhou, Bharatbhushan Shetty, Brendan Kitts, Shengjun Pan, Junwei Pan, Aaron Flores:
Bid Shading in The Brave New World of First-Price Auctions. CoRR abs/2009.01360 (2020) - [i3]Shengjun Pan, Brendan Kitts, Tian Zhou, Hao He, Bharatbhushan Shetty, Aaron Flores, Djordje Gligorijevic, Junwei Pan, Tingyu Mao, San Gultekin, Jianlong Zhang:
Bid Shading by Win-Rate Estimation and Surplus Maximization. CoRR abs/2009.09259 (2020)
2010 – 2019
- 2018
- [c17]Junwei Pan, Jian Xu, Alfonso Lobos Ruiz, Wenliang Zhao, Shengjun Pan, Yu Sun, Quan Lu:
Field-weighted Factorization Machines for Click-Through Rate Prediction in Display Advertising. WWW 2018: 1349-1357 - [i2]Junwei Pan, Jian Xu, Alfonso Lobos Ruiz, Wenliang Zhao, Shengjun Pan, Yu Sun, Quan Lu:
Field-weighted Factorization Machines for Click-Through Rate Prediction in Display Advertising. CoRR abs/1806.03514 (2018) - 2017
- [c16]Quan Lu, Shengjun Pan, Liang Wang, Junwei Pan, Fengdan Wan, Hongxia Yang:
A Practical Framework of Conversion Rate Prediction for Online Display Advertising. ADKDD@KDD 2017: 9:1-9:9 - 2015
- [j4]Dan McQuillan, Shengjun Pan, R. Bruce Richter:
On the crossing number of K13. J. Comb. Theory B 115: 224-235 (2015) - [j3]Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
String Reconstruction from Substring Compositions. SIAM J. Discret. Math. 29(3): 1340-1371 (2015) - 2014
- [c15]Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
Quadratic-backtracking algorithm for string reconstruction from substring compositions. ISIT 2014: 1296-1300 - [i1]Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
String Reconstruction from Substring Compositions. CoRR abs/1403.2439 (2014) - 2013
- [c14]Enming Luo, Stanley H. Chan, Shengjun Pan, Truong Q. Nguyen:
Adaptive non-local means for multiview image denoising: Searching for the right patches via a statistical approach. ICIP 2013: 543-547 - 2012
- [b1]Shengjun Pan:
On the theory and application of pattern maximum likelihood. University of California, San Diego, USA, 2012 - [c13]Enming Luo, Shengjun Pan, Truong Q. Nguyen:
Generalized non-local means for iterative denoising. EUSIPCO 2012: 260-264 - [c12]Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan:
Estimating multiple concurrent processes. ISIT 2012: 1628-1632 - [c11]Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan, Ananda Theertha Suresh:
On the query computation and verification of functions. ISIT 2012: 2711-2715 - [c10]Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan, Ananda Theertha Suresh:
Competitive Classification and Closeness Testing. COLT 2012: 22.1-22.18 - 2011
- [c9]Juxian Zuo, Shengjun Pan, Benyong Liu, Xiang Liao:
Tampering detection for composite images based on re-sampling and JPEG compression. ACPR 2011: 169-173 - [c8]Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan:
Algebraic computation of pattern maximum likelihood. ISIT 2011: 400-404 - [c7]Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan:
Competitive Closeness Testing. COLT 2011: 47-68 - 2010
- [c6]Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
On reconstructing a string from its substring compositions. ISIT 2010: 1238-1242 - [c5]Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan, Narayana P. Santhanam:
Classification using pattern probability estimators. ISIT 2010: 1493-1497 - [c4]Jayadev Acharya, Hirakendu Das, Hosein Mohimani, Alon Orlitsky, Shengjun Pan:
Exact calculation of pattern probabilities. ISIT 2010: 1498-1502
2000 – 2009
- 2009
- [c3]Alon Orlitsky, Shengjun Pan:
The maximum likelihood probability of skewed patterns. ISIT 2009: 1130-1134 - [c2]Shengjun Pan, Jayadev Acharya, Alon Orlitsky:
The maximum likelihood probability of unique-singleton, ternary, and length-7 patterns. ISIT 2009: 1135-1139 - [c1]Jayadev Acharya, Alon Orlitsky, Shengjun Pan:
Recent results on pattern maximum likelihood. ITW 2009: 251-255 - 2007
- [j2]József Balogh, Jesús Leaños, Shengjun Pan, R. Bruce Richter, Gelasio Salazar:
The convex hull of every optimal pseudolinear drawing of Kn is a triangle. Australas. J Comb. 38: 155-162 (2007) - [j1]Shengjun Pan, R. Bruce Richter:
The crossing number of K11 is 100. J. Graph Theory 56(2): 128-134 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-08 02:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
