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 47 matches
- 2004
- Dana Angluin, Jiang Chen:
Learning a Hidden Graph Using O(log n) Queries Per Edge. COLT 2004: 210-223 - Peter Auer, Ronald Ortner:
A New PAC Bound for Intersection-Closed Concept Classes. COLT 2004: 408-414 - Arik Azran, Ron Meir:
Data Dependent Risk Bounds for Hierarchical Mixture of Experts Classifiers. COLT 2004: 427-441 - Peter L. Bartlett, Shahar Mendelson, Petra Philips:
Local Complexities for Empirical Risk Minimization. COLT 2004: 270-284 - Peter L. Bartlett, Ambuj Tewari:
Sparseness Versus Estimating Conditional Probabilities: Some Asymptotic Results. COLT 2004: 564-578 - Tugkan Batu, Sudipto Guha, Sampath Kannan:
Inferring Mixtures of Markov Chains. COLT 2004: 186-199 - Mikhail Belkin, Irina Matveeva, Partha Niyogi:
Regularization and Semi-supervised Learning on Large Graphs. COLT 2004: 624-638 - Shai Ben-David:
A Framework for Statistical Clustering with a Constant Time Approximation Algorithms for K-Median Clustering. COLT 2004: 415-426 - Gilles Blanchard, Christin Schäfer, Yves Rozenholc:
Oracle Bounds and Exact Algorithm for Dyadic Classification Trees. COLT 2004: 378-392 - Nader H. Bshouty:
Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability. COLT 2004: 64-76 - Constantine Caramanis, Shie Mannor:
An Inequality for Nearly Log-Concave Distributions with Applications to Learning. COLT 2004: 534-548 - Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile:
Regret Bounds for Hierarchical Classification with Linear-Threshold Functions. COLT 2004: 93-108 - Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz:
Minimizing Regret with Label Efficient Prediction. COLT 2004: 77-92 - François Denis, Yann Esposito:
Learning Classes of Probabilistic Automata. COLT 2004: 124-139 - Evgeny Drukh, Yishay Mansour:
Concentration Bounds for Unigrams Language Model. COLT 2004: 170-185 - Miroslav Dudík, Steven J. Phillips, Robert E. Schapire:
Performance Guarantees for Regularized Maximum Entropy Density Estimation. COLT 2004: 472-486 - Magalie Fromont:
Model Selection by Bootstrap Penalization for Classification. COLT 2004: 285-299 - Dmitry Gavinsky, Avi Owshanko:
PExact = Exact Learning. COLT 2004: 200-209 - Ran Gilad-Bachrach, Amir Navot, Naftali Tishby:
Bayes and Tukey Meet at the Center Point. COLT 2004: 549-563 - Peter Grünwald, John Langford:
Suboptimal Behavior of Bayes and MDL in Classification Under Misspecification. COLT 2004: 331-347 - David C. Hoyle, Magnus Rattray:
A Statistical Mechanics Analysis of Gram Matrix Eigenvalue Spectra. COLT 2004: 579-593 - Tony Jebara:
Kernelizing Sorting, Permutation, and Alignment for Minimum Volume PCA. COLT 2004: 609-623 - Sham M. Kakade, Dean P. Foster:
Deterministic Calibration and Nash Equilibrium. COLT 2004: 33-48 - Sham M. Kakade, Michael J. Kearns, Luis E. Ortiz:
Graphical Economics. COLT 2004: 17-32 - Adam Kalai:
Learning Monotonic Linear Functions. COLT 2004: 487-501 - Adam R. Klivans, Rocco A. Servedio:
Learning Intersections of Halfspaces with a Margin. COLT 2004: 348-362 - Adam R. Klivans, Rocco A. Servedio:
Perceptron-Like Performance for Intersections of Halfspaces. COLT 2004: 639-640 - Adam R. Klivans, Rocco A. Servedio:
Toward Attribute Efficient Learning of Decision Lists and Parities. COLT 2004: 224-238 - Steffen Lange, Sandra Zilles:
Replacing Limit Learners with Equally Powerful One-Shot Query Learners. COLT 2004: 155-169 - Nikolas List, Hans Ulrich Simon:
A General Convergence Theorem for the Decomposition Method. COLT 2004: 363-377
skipping 17 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-12-23 10:10 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