default search action
Eric Bax
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i23]Miguel Alcobendas, Eric Bax:
Pre- and Post-Auction Discounts in First-Price Auctions. CoRR abs/2403.06278 (2024) - [i22]Eric Bax, Arundhyoti Sarkar, Alex Shtoff:
Early Stopping Based on Repeated Significance. CoRR abs/2408.00908 (2024) - [i21]Eric Bax, Arundhyoti Sarkar, Alex Shtoff:
Continuous Monitoring via Repeated Significance. CoRR abs/2408.02821 (2024) - [i20]Charlie Dickens, Eric Bax, Alexander Saydakov:
Key Compression Limits for k-Minimum Value Sketches. CoRR abs/2409.02852 (2024) - 2023
- [c16]Charlie Dickens, Eric Bax:
Matching Noisy Keys for Obfuscation. IEEE Big Data 2023: 5485-5492 - [c15]Eric Bax, Melissa Gerber, Lisa Giaffo, Arundhyoti Sarkar, Nikki Thompson, Will Wagner, Kimberly Williams:
Generative AI: Citations for Trust and Consensus. FTC (1) 2023: 188-195 - [i19]Charlie Dickens, Eric Bax:
Matching Noisy Keys for Obfuscation. CoRR abs/2312.08981 (2023) - 2022
- [c14]Eric Bax, Arundhyoti Sarkar, Natalie Bax:
Multiple Statistics: Marking Significance. IEEE Big Data 2022: 6590-6592 - [c13]Eric Bax, Charlotte Bax:
Even Large Samples Have Challenges: Rare Events, Gaps, and Tails. IEEE Big Data 2022: 6593-6595 - [i18]Eric Bax, John Donald:
Sharp Frequency Bounds for Sample-Based Queries. CoRR abs/2208.06753 (2022) - 2021
- [c12]Eric Bax, Frédéric Ouimet
:
Bounding Means of Discrete Distributions. IEEE BigData 2021: 5024-5032 - [c11]Eric Bax:
When to Re-Draw a Sample, and Why. IEEE BigData 2021: 5848-5850 - [i17]Eric Bax:
Selecting a number of voters for a voting ensemble. CoRR abs/2104.11833 (2021) - [i16]Eric Bax, Frédéric Ouimet:
Bounding Means of Discrete Distributions. CoRR abs/2109.02538 (2021) - 2020
- [c10]Eric Bax, Charlotte Bax:
SAFE - Secure Aggregated Frequency Estimates. IEEE BigData 2020: 5633-5635 - [i15]Eric Bax:
Heavy Tails Make Happy Buyers. CoRR abs/2002.09014 (2020)
2010 – 2019
- 2019
- [j8]Eric Bax, Lingjie Weng, Xu Tian:
Speculate-correct error bounds for k-nearest neighbor classifiers. Mach. Learn. 108(12): 2087-2111 (2019) - [c9]Eric Bax, John Donald:
Sharp Frequency Bounds for Sample-Based Queries. IEEE BigData 2019: 5983-5985 - [c8]Eric Bax, Farshad Kooti:
Ensemble Validation: Selectivity has a Price, but Variety is Free. IJCNN 2019: 1-8 - [i14]Eric Bax:
Computing a Data Dividend. CoRR abs/1905.01805 (2019) - [i13]Eric Bax, John Donald, Melissa Gerber, Lisa Giaffo, Tanisha Sharma, Nikki Thompson, Kimberly Williams:
Data Consortia. CoRR abs/1906.11803 (2019) - [i12]Eric Bax:
Collecting Charges for Ad Impact on User Experience for Different Price Types. CoRR abs/1911.12458 (2019) - 2017
- [c7]Farshad Kooti, Mihajlo Grbovic, Luca Maria Aiello
iPhone's Digital Marketplace: Characterizing the Big Spenders. WSDM 2017: 13-21 - [i11]Farshad Kooti, Mihajlo Grbovic, Luca Maria Aiello, Eric Bax, Kristina Lerman:
iPhone's Digital Marketplace: Characterizing the Big Spenders. CoRR abs/1701.07411 (2017) - 2016
- [c6]Ya Le, Eric Bax, Nicola Barbieri, David García-Soriano
Validation of matching. IJCNN 2016: 4457-4464 - [i10]Eric Bax, Farshad Kooti:
Ensemble Validation: Selectivity has a Price, but Variety is Free. CoRR abs/1610.01234 (2016) - 2015
- [c5]Eric Bax:
Improved error bounds based on worst likely assignments. IJCNN 2015: 1-6 - [i9]Eric Bax:
Improved Error Bounds Based on Worst Likely Assignments. CoRR abs/1504.00052 (2015) - [i8]Zheng Wen, Eric Bax, James Li:
Selecting Weight Functions to Spur Competition in Quasi-Proportional Auctions. CoRR abs/1504.08333 (2015) - [i7]James Li, Eric Bax, Nilanjan Roy, Andrea Leistra:
VCG Payments for Portfolio Allocations in Online Advertising. CoRR abs/1506.02013 (2015) - [i6]Ragavendran Gopalakrishnan, Eric Bax, Krishna Prasad Chitrapura, Sachin Garg:
Portfolio Allocation for Sellers in Online Advertising. CoRR abs/1506.02020 (2015) - [i5]Eric Bax, James Li, Zheng Wen:
Exponential Weight Functions for Quasi-Proportional Auctions. CoRR abs/1509.01314 (2015) - [i4]Eric Bax, Ya Le:
Some Theory For Practical Classifier Validation. CoRR abs/1510.02676 (2015) - 2014
- [i3]Eric Bax, Lingjie Weng, Xu Tian:
Validation of k-Nearest Neighbor Classifiers Using Inclusion and Exclusion. CoRR abs/1410.2500 (2014) - [i2]Ya Le, Eric Bax, Nicola Barbieri, David García-Soriano, Jitesh Mehta, James Li:
Validation of Network Reconciliation. CoRR abs/1411.0023 (2014) - [i1]Valeria Stourm, Eric Bax:
Pigovian Taxes Can Increase Platform Competitiveness: The Case of Online Display Advertising. CoRR abs/1411.0710 (2014) - 2012
- [j7]Eric Bax:
Validation of k-Nearest Neighbor Classifiers. IEEE Trans. Inf. Theory 58(5): 3225-3234 (2012) - [c4]James Li, Abdullah Sonmez, Zehra Cataltepe, Eric Bax:
Validation of Network Classifiers. SSPR/SPR 2012: 448-457
2000 – 2009
- 2008
- [j6]Eric Bax, Augusto Callejas:
An Error Bound Based on a Worst Likely Assignment. J. Mach. Learn. Res. 9: 859-891 (2008) - [j5]Eric Bax:
Nearly Uniform Validation Improves Compression-Based Error Bounds. J. Mach. Learn. Res. 9: 1741-1755 (2008) - 2005
- [c3]Elli Albek, Eric Bax, Greg Billock, K. Mani Chandy, Ian Swett:
An Event Processing Language (EPL) for Building Sense and Respond Applications. IPDPS 2005 - 2000
- [j4]Eric Bax:
Validation of nearest neighbor classifiers. IEEE Trans. Inf. Theory 46(7): 2746-2752 (2000) - [c2]Eric Bax:
Using Validation by Inference to Select a Hypothesis Function. ICPR 2000: 2700-2703
1990 – 1999
- 1999
- [j3]Eric Bax:
Improved Hoeffding-style performance guarantees for accurate classifiers. Pattern Recognit. Lett. 20(4): 445-449 (1999) - [j2]Eric Bax:
Partition-based and sharp uniform error bounds. IEEE Trans. Neural Networks 10(6): 1315-1320 (1999) - [c1]Eric Bax:
Validation of fusion through linear programming. IJCNN 1999: 572-575 - 1998
- [b1]Eric Bax:
Finite-difference algorithms for counting problems. California Institute of Technology, USA, 1998 - [j1]Eric Bax:
Validation of average error rate over classifiers. Pattern Recognit. Lett. 19(2): 127-132 (1998)
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-10-07 01:27 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: