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 38 matches
- 1996
- Andris Ambainis:
Probabilistic and Team PFIN-Type Learning: General Properties. COLT 1996: 157-168 - András Antos, Gábor Lugosi:
Strong Minimax Lower Bounds for Learning. COLT 1996: 303-309 - Peter Auer, Stephen Kwek, Wolfgang Maass, Manfred K. Warmuth:
Learning of Depth Two Neural Networks with Constant Fan-In at the Hidden Nodes (Extended Abstract). COLT 1996: 333-343 - Ganesh Baliga, John Case, Sanjay Jain:
Synthesizing Enumeration Techniques for Language Learning. COLT 1996: 169-180 - Peter L. Bartlett, Shai Ben-David, Sanjeev R. Kulkarni:
Learning Changing Concepts by Exploiting the Structure of Change. COLT 1996: 131-139 - Rakesh D. Barve, Philip M. Long:
On the Complexity of Learning from Drifting Distributions. COLT 1996: 122-130 - Jonathan Baxter:
A Bayesian/Information Theoretic Model of Bias Learning. COLT 1996: 77-88 - Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jackson, Norbert Klasner, Hans Ulrich Simon:
On Restricted-Focus-of-Attention Learnability of Boolean Functions. COLT 1996: 205-216 - Nader H. Bshouty, Lisa Hellerstein:
Attribute-Efficient Learning in Query and Mistake-Bound Models. COLT 1996: 235-243 - Nader H. Bshouty, Christino Tamon, David K. Wilson:
On Learning width Two Branching Programs (Extended Abstract). COLT 1996: 224-227 - Nicolò Cesa-Bianchi, David P. Helmbold, Sandra Panizza:
On Bayes Methods for On-Line Boolean Prediction. COLT 1996: 314-324 - William W. Cohen:
The Dual DFA Learning Problem: Hardness Results for Programming by Demonstration and Learning First-Order Representations (Extended Abstract). COLT 1996: 29-40 - Aaron Feigelson, Lisa Hellerstein:
Learning Conjunctions of Two Unate DNF Formulas (Extended Abstract): Computational and Informational Results. COLT 1996: 255-265 - Yoav Freund:
Predicting a Binary Sequence Almost As Well As the Optimal Biased Coin. COLT 1996: 89-98 - Yoav Freund, Robert E. Schapire:
Game Theory, On-Line Prediction and Boosting. COLT 1996: 325-332 - Igal Galperin:
Analysis of Greedy Expert Hiring and an Application to Memory-Based Learning (Extended Abstract). COLT 1996: 217-223 - Leslie Ann Goldberg:
Analysis of a Simple Learning Algorithm: Learning Foraging Thresholds for Lizards. COLT 1996: 2-9 - Sean B. Holden:
PAC-Like Upper Bounds for the Sample Complexity of Leave-one-Out Cross-Validation. COLT 1996: 41-50 - Sanjay Jain, Arun Sharma:
Elementary Formal Systems, Intrinsic Complexity, and Procrastination. COLT 1996: 181-192 - Dick De Jongh, Makoto Kanazawa:
Angluin's Theorem for Indexed Families of r.e. Sets and Applications. COLT 1996: 193-204 - Sven Koenig, Yury V. Smirnov:
Graph Learning with a Nearest Neighbor Approach. COLT 1996: 19-28 - Martin Kummer, Matthias Ott:
Learning Branches and Learning to Win Closed Games. COLT 1996: 280-291 - Eyal Kushilevitz:
A Simple Algorithm for Learning O(log n)-Term DNF. COLT 1996: 266-269 - Stephen Kwek, Leonard Pitt:
PAC Learning Intersections of Halfspaces with Membership Queries (Extended Abstract). COLT 1996: 244-254 - Wee Sun Lee, Peter L. Bartlett, Robert C. Williamson:
The Importance of Convexity in Learning with Squared Loss. COLT 1996: 140-146 - David D. Lewis:
Challenges in Machine Learning for Text Classification. COLT 1996: 1 - Philip M. Long, Lei Tan:
PAC Learning Axis-Aligned Rectangles with Respect to Product Distributions from Multiple-Instance Examples. COLT 1996: 228-234 - Gábor Lugosi, Márta Pintér:
A Data-Dependent Skeleton Estimate for Learning. COLT 1996: 51-56 - Wolfgang Merkle, Frank Stephan:
Trees and Learning. COLT 1996: 270-279 - Erik Ordentlich, Thomas M. Cover:
On-Line Portfolio Selection. COLT 1996: 310-313
skipping 8 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-11-19 13:16 CET 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