![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 37 matches
- 1990
- Naoki Abe, Manfred K. Warmuth:
On the Computational Complexity of Approximating Distributions by Probabilistic Automata. COLT 1990: 52-66 - Dana Angluin, Michael Frazier, Leonard Pitt:
Learning Conjunctions of Horn Clauses (Abstract). COLT 1990: 387 - Martin Anthony, Norman Biggs, John Shawe-Taylor:
The Learnability of Formal Concepts. COLT 1990: 246-257 - Javed A. Aslam, Ronald L. Rivest:
Inferring Graphs from Walks. COLT 1990: 359-370 - Eric B. Baum:
Polynomial Time Algorithms for Learning Neural Nets. COLT 1990: 258-272 - Shai Ben-David, Alon Itai, Eyal Kushilevitz:
Learning by Distances. COLT 1990: 232-245 - Avrim Blum:
Separating PAC and Mistake-Bound Learning Models Over the Boolean Domain (Abstract). COLT 1990: 393 - Avrim Blum, Mona Singh:
Learning Functions of k Terms. COLT 1990: 144-153 - Bonnie Eisenberg, Ronald L. Rivest:
On the Sample Complexity of PAC-Learning Using Random and Chosen Examples. COLT 1990: 154-162 - Paul Fischer, Hans Ulrich Simon:
On Learning Ring-Sum-Expansions. COLT 1990: 130-143 - Rusins Freivalds:
Inductive Inference of Minimal Programs. COLT 1990: 3-22 - Yoav Freund:
Boosting a Weak Learning Algorithm by Majority. COLT 1990: 202-216 - Mark A. Fulk:
Robust Separations in Inductive Inference (Abstract). COLT 1990: 392 - William I. Gasarch, Mark G. Pleszkoch, Robert Solovay:
Learning Via Queries in [+, <]. COLT 1990: 338-351 - Sally A. Goldman, Michael J. Kearns, Robert E. Schapire:
On the Sample Complexity of Weak Learning. COLT 1990: 217-231 - Sally A. Goldman, Michael J. Kearns, Robert E. Schapire:
Exact Identification of Circuits Using Fixed Points of Amplification Functions (Abstract). COLT 1990: 388 - Thomas R. Hancock:
Identifying µ-Formula Decision Trees with Queries. COLT 1990: 23-37 - David P. Helmbold, Robert H. Sloan, Manfred K. Warmuth:
Learning Integer Lattices. COLT 1990: 288-302 - Sanjay Jain, Arun Sharma:
Finite Learning by a "Team". COLT 1990: 163-177 - Michael J. Kearns, Robert E. Schapire:
Efficient Distribution-Free Learning of Probabilistic Concepts (Abstract). COLT 1990: 389 - Efim B. Kinber:
Some Problems of Learning with an Oracle. COLT 1990: 178-186 - Efim B. Kinber, William I. Gasarch, Thomas Zeugmann, Mark G. Pleszkoch, Carl H. Smith:
Learning Via Queries With Teams and Anomilies. COLT 1990: 327-337 - Ker-I Ko:
On the Complexity of Learning Minimum Time-Bounded Turing Machines. COLT 1990: 82-96 - Philip M. Long, Manfred K. Warmuth:
Composite Geometric Concepts and Polynomial Predictability. COLT 1990: 273-287 - Wolfgang Maass, György Turán:
On the Complexity of Learning from Counterexamples and Membership Queries (abstract). COLT 1990: 391 - Pekka Orponen, Russell Greiner:
On the Sample Complexity of Finding Good Search Strategies. COLT 1990: 352-358 - Daniel N. Osherson, Michael Stob, Scott Weinstein:
A Mechanical Method of Successful Scientific Inquiry. COLT 1990: 187-201 - Ramamohan Paturi, Michael E. Saks:
On Threshold Circuits for Parity (Abstract). COLT 1990: 390 - Vijay Raghavan, Stephen R. Schach:
Learning Switch Configurations. COLT 1990: 38-51 - Robert E. Schapire:
Pattern Languages are not Learnable. COLT 1990: 122-129
skipping 7 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-20 23:32 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