default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 146 matches
- 2001
- José L. Balcázar, Jorge Castro, David Guijarro:
A General Dimension for Exact Learning. COLT/EuroCOLT 2001: 354-367 - Peter L. Bartlett, Shahar Mendelson:
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results. COLT/EuroCOLT 2001: 224-240 - Shai Ben-David, Nadav Eiron, Hans Ulrich Simon:
Limitations of Learning via Embeddings in Euclidean Half-Spaces. COLT/EuroCOLT 2001: 385-401 - Shai Ben-David, Philip M. Long, Yishay Mansour:
Agnostic Boosting. COLT/EuroCOLT 2001: 507-516 - Olivier Bousquet, Manfred K. Warmuth:
Tracking a Small Set of Experts by Mixing Past Posteriors. COLT/EuroCOLT 2001: 31-47 - Nader H. Bshouty, Nadav Eiron:
Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries. COLT/EuroCOLT 2001: 546-557 - Nader H. Bshouty, Vitaly Feldman:
On Using Extended Statistical Queries to Avoid Membership Queries. COLT/EuroCOLT 2001: 529-545 - Nader H. Bshouty, Dmitry Gavinsky:
On Boosting with Optimal Poly-Bounded Distributions. COLT/EuroCOLT 2001: 490-506 - Nader H. Bshouty, Avi Owshanko:
Learning Regular Sets with an Incomplete Membership Oracle. COLT/EuroCOLT 2001: 574-588 - John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen:
Robust Learning - Rich and Poor. COLT/EuroCOLT 2001: 143-159 - Nicolò Cesa-Bianchi, Gábor Lugosi:
Potential-Based Algorithms in Online Prediction and Game Theory. COLT/EuroCOLT 2001: 48-64 - Deepak Chawla, Lin Li, Stephen Scott:
Efficiently Approximating Weighted Sums with Exponentially Many Terms. COLT/EuroCOLT 2001: 82-98 - Koby Crammer, Yoram Singer:
Ultraconservative Online Algorithms for Multiclass Problems. COLT/EuroCOLT 2001: 99-115 - Eyal Even-Dar, Yishay Mansour:
Learning Rates for Q-Learning. COLT/EuroCOLT 2001: 589-604 - Jürgen Forster, Niels Schmitt, Hans Ulrich Simon:
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. COLT/EuroCOLT 2001: 402-415 - Paul W. Goldberg:
Estimating a Boolean Perceptron from Its Average Satisfying Assignment: A Bound on the Precision Required. COLT/EuroCOLT 2001: 116-127 - Paul W. Goldberg:
When Can Two Unsupervised Learners Achieve PAC Separation? COLT/EuroCOLT 2001: 303-319 - Peter Grünwald:
Strong Entropy Concentration, Game Theory, and Algorithmic Randomness. COLT/EuroCOLT 2001: 320-336 - Mark Herbster:
Learning Additive Models Online with Fast Evaluating Kernels. COLT/EuroCOLT 2001: 444-460 - Sanjay Jain, Efim B. Kinber:
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data. COLT/EuroCOLT 2001: 177-193 - Sham M. Kakade:
Optimizing Average Reward Using Discounted Rewards. COLT/EuroCOLT 2001: 605-615 - Balázs Kégl, Tamás Linder, Gábor Lugosi:
Data-Dependent Margin-Based Generalization Bounds for Classification. COLT/EuroCOLT 2001: 368-384 - Vladimir Koltchinskii, Dmitriy Panchenko, Fernando Lozano:
Further Explanation of the Effectiveness of Voting Methods: The Game between Margins and Weights. COLT/EuroCOLT 2001: 241-255 - Wee Sun Lee, Philip M. Long:
A Theoretical Analysis of Query Selection for Collaborative Filtering. COLT/EuroCOLT 2001: 517-528 - Philip M. Long:
On Agnostic Learning with {0, *, 1}-Valued and Real-Valued Hypotheses. COLT/EuroCOLT 2001: 289-302 - Shie Mannor, Ron Meir:
Geometric Bounds for Generalization in Boosting. COLT/EuroCOLT 2001: 461-472 - Shie Mannor, Nahum Shimkin:
Adaptive Strategies and Regret Minimization in Arbitrarily Varying Markov Environments. COLT/EuroCOLT 2001: 128-142 - Shahar Mendelson:
Geometric Methods in the Analysis of Glivenko-Cantelli Classes. COLT/EuroCOLT 2001: 256-272 - Shahar Mendelson:
Learning Relatively Small Classes. COLT/EuroCOLT 2001: 273-288 - Ilia Nouretdinov, Volodya Vovk, Michael V. Vyugin, Alex Gammerman:
Pattern Recognition and Density Estimation under the General i.i.d. Assumption. COLT/EuroCOLT 2001: 337-353
skipping 116 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-19 13:54 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint