Shengjun Pan

According to our database1, Shengjun Pan authored at least 26 papers between 2007 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
An Efficient Deep Distribution Network for Bid Shading in First-Price Auctions.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

MEOW: A Space-Efficient Nonparametric Bid Shading Algorithm.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

2020
Bid Shading by Win-Rate Estimation and Surplus Maximization.
CoRR, 2020

Bid Shading in The Brave New World of First-Price Auctions.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2018
Field-weighted Factorization Machines for Click-Through Rate Prediction in Display Advertising.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

2017
A Practical Framework of Conversion Rate Prediction for Online Display Advertising.
Proceedings of the ADKDD'17, Halifax, NS, Canada, August 13 - 17, 2017, 2017

2015
String Reconstruction from Substring Compositions.
SIAM J. Discret. Math., 2015

On the crossing number of K<sub>13</sub>.
J. Comb. Theory, Ser. B, 2015

2014
Quadratic-backtracking algorithm for string reconstruction from substring compositions.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Adaptive non-local means for multiview image denoising: Searching for the right patches via a statistical approach.
Proceedings of the IEEE International Conference on Image Processing, 2013

2012
On the theory and application of pattern maximum likelihood.
PhD thesis, 2012

Competitive Classification and Closeness Testing.
Proceedings of the COLT 2012, 2012

On the query computation and verification of functions.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Estimating multiple concurrent processes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Generalized non-local means for iterative denoising.
Proceedings of the 20th European Signal Processing Conference, 2012

2011
Competitive Closeness Testing.
Proceedings of the COLT 2011, 2011

Algebraic computation of pattern maximum likelihood.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Tampering detection for composite images based on re-sampling and JPEG compression.
Proceedings of the First Asian Conference on Pattern Recognition, 2011

2010
Classification using pattern probability estimators.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Exact calculation of pattern probabilities.
Proceedings of the IEEE International Symposium on Information Theory, 2010

On reconstructing a string from its substring compositions.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Recent results on pattern maximum likelihood.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

The maximum likelihood probability of unique-singleton, ternary, and length-7 patterns.
Proceedings of the IEEE International Symposium on Information Theory, 2009

The maximum likelihood probability of skewed patterns.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2007
The crossing number of <i>K</i><sub>11</sub> is 100.
J. Graph Theory, 2007

The convex hull of every optimal pseudolinear drawing of K<sub>n</sub> is a triangle.
Australas. J Comb., 2007


  Loading...