default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaming Yu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j23]Abdulrahman Alsaudi, Yasser Altowim, Sharad Mehrotra, Yaming Yu:
TQEL: Framework for Query-Driven Linking of Top-K Entities in Social Media Blogs. Proc. VLDB Endow. 14(11): 2642-2654 (2021)
2010 – 2019
- 2017
- [j22]Yaming Yu:
Minimum variance in the coupon collector's problem. J. Appl. Probab. 54(2): 655-656 (2017) - [i11]Ran Hadad, Uri Erez, Yaming Yu:
An Inequality for the Correlation of Two Functions Operating on Symmetric Bivariate Normal Variables. CoRR abs/1702.06144 (2017) - 2016
- [j21]Clifford Anderson-Bergman, Yaming Yu:
Computing the log concave NPMLE for interval censored data. Stat. Comput. 26(4): 813-826 (2016) - [c3]Mehdi Sadri, Sharad Mehrotra, Yaming Yu:
Online Adaptive Topic Focused Tweet Acquisition. CIKM 2016: 2353-2358 - 2014
- [c2]Abinesh Ramakrishnan, Sundar Rajan Krishnamurthy, Syed Ali Jafar
, Yaming Yu:
Degrees of freedom of interference channel with rank-deficient transfer matrix. ISIT 2014: 1221-1225 - 2013
- [i10]Tianbing Xu, Yaming Yu, John Turner, Amelia Regan:
Thompson Sampling in Dynamic Systems for Contextual Bandit Problems. CoRR abs/1310.5008 (2013) - 2012
- [j20]Yosef Rinott, Marco Scarsini, Yaming Yu:
A Colonel Blotto Gladiator Game. Math. Oper. Res. 37(4): 574-590 (2012) - [j19]Rabia Nuray-Turan, Dmitri V. Kalashnikov, Sharad Mehrotra, Yaming Yu:
Attribute and object selection queries on objects with probabilistic attributes. ACM Trans. Database Syst. 37(1): 3:1-3:41 (2012) - [i9]Yosef Rinott, Marco Scarsini, Yaming Yu:
A Colonel Blotto Gladiator Game. CoRR abs/1205.5788 (2012) - 2011
- [j18]Yaming Yu:
D-optimal designs via a cocktail algorithm. Stat. Comput. 21(4): 475-481 (2011) - [i8]Yaming Yu:
On Log-concavity of the Generalized Marcum Q Function. CoRR abs/1105.5762 (2011) - 2010
- [j17]Yaming Yu:
Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs. Comput. Stat. Data Anal. 54(6): 1419-1425 (2010) - [j16]José A. Adell, Alberto Lekuona, Yaming Yu:
Sharp bounds on the entropy of the poisson law and related quantities. IEEE Trans. Inf. Theory 56(5): 2299-2306 (2010) - [j15]Yaming Yu:
Squeezing the Arimoto-Blahut algorithm for faster convergence. IEEE Trans. Inf. Theory 56(7): 3149-3157 (2010) - [j14]Oliver Johnson, Yaming Yu:
Monotonicity, Thinning, and Discrete Versions of the Entropy Power Inequality. IEEE Trans. Inf. Theory 56(11): 5387-5395 (2010) - [i7]José A. Adell, Alberto Lekuona, Yaming Yu:
Sharp Bounds on the Entropy of the Poisson Law and Related Quantities. CoRR abs/1001.2897 (2010)
2000 – 2009
- 2009
- [j13]Yaming Yu:
Confirming two conjectures of Su and Wang on binomial coefficients. Adv. Appl. Math. 43(4): 317-322 (2009) - [j12]Yaming Yu:
Bounds on the location of the maximum Stirling numbers of the second kind. Discret. Math. 309(13): 4624-4627 (2009) - [j11]Yaming Yu:
Problem 11416. Am. Math. Mon. 116(2): 180 (2009) - [j10]Yaming Yu:
On the entropy of compound distributions on nonnegative integers. IEEE Trans. Inf. Theory 55(8): 3645-3650 (2009) - [j9]Yaming Yu:
Monotonic convergence in an information-theoretic law of small numbers. IEEE Trans. Inf. Theory 55(12): 5412-5422 (2009) - [c1]Yaming Yu, Oliver Johnson:
Concavity of entropy under thinning. ISIT 2009: 144-148 - [i6]Yaming Yu, Oliver Johnson:
Concavity of entropy under thinning. CoRR abs/0904.1446 (2009) - [i5]Yaming Yu:
Squeezing the Arimoto-Blahut algorithm for faster convergence. CoRR abs/0906.3849 (2009) - [i4]Oliver Johnson, Yaming Yu:
Monotonicity, thinning and discrete versions of the Entropy Power Inequality. CoRR abs/0909.0641 (2009) - [i3]Yaming Yu:
On an Inequality of Karlin and Rinott Concerning Weighted Sums of i.i.d. Random Variables. CoRR abs/0909.4126 (2009) - 2008
- [j8]Yaming Yu:
Evaluation of a Multiple Integral of Tefera via Properties of the Exponential Distribution. Electron. J. Comb. 15(1) (2008) - [j7]Yaming Yu:
Efficient simulation of a bivariate exponential conditionals distribution. Comput. Stat. Data Anal. 52(5): 2273-2276 (2008) - [j6]Yaming Yu:
Problem 11403. Am. Math. Mon. 115(10): 949 (2008) - [j5]Yaming Yu:
Maximum Entropy for Sums of Symmetric and Bounded Random Variables: A Short Derivation. IEEE Trans. Inf. Theory 54(4): 1818-1819 (2008) - [j4]Yaming Yu:
On the Maximum Entropy Properties of theBinomial Distribution. IEEE Trans. Inf. Theory 54(7): 3351-3353 (2008) - [j3]Yaming Yu:
A Bit of Information Theory, and the Data Augmentation Algorithm Converges. IEEE Trans. Inf. Theory 54(11): 5186-5188 (2008) - [i2]Yaming Yu:
Convergence and Monotonicity Problems in an Information-Theoretic Law of Small Numbers. CoRR abs/0810.5203 (2008) - [i1]Yaming Yu:
A Bit of Information Theory, and the Data Augmentation Algorithm Converges. CoRR abs/0811.0174 (2008) - 2006
- [j2]Yaming Yu:
More Forbidden Minors for Wye-Delta-Wye Reducibility. Electron. J. Comb. 13(1) (2006) - 2004
- [j1]Yaming Yu:
Forbidden minors for wye-delta-wye reducibility. J. Graph Theory 47(4): 317-321 (2004)
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-04-24 22:49 CEST 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:
