![](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 31 matches
- 1997
- Andris Ambainis, Kalvis Apsitis, Cristian Calude, Rusins Freivalds, Marek Karpinski, Tomas Larfeldt, Iveta Sala, Juris Smotrovs
:
Effects of Kolmogorov Complexity Present in Inductive Inference as Well. ALT 1997: 244-259 - Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, William I. Gasarch, Carl H. Smith:
Team Learning as a Game. ALT 1997: 2-17 - Hiroki Arimura
:
Learning Acyclic First-Order Horn Sentences from Entailment. ALT 1997: 432-445 - Vikraman Arvind, N. V. Vinodchandran:
Exact Learning via Teaching Assistants (Extended Abstract). ALT 1997: 291-306 - Manuel Blum:
Program Error Detection/Correction: Turning PAC Learning into PERFECT Learning (Abstract). ALT 1997: 1 - Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Monotone Extensions of Boolean Data Sets. ALT 1997: 161-175 - John Case, Sanjay Jain, Arun Sharma
:
Synthesizing Noise-Tolerant Language Learners. ALT 1997: 228-243 - François Denis, Rémi Gilleron:
PAC Learning under Helpful Distributions. ALT 1997: 132-145 - Carlos Domingo, Tatsuie Tsukiji, Osamu Watanabe:
Partial Occam's Razor and Its Applications. ALT 1997: 85-99 - Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann:
Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries. ALT 1997: 260-276 - Leonid Gurvits:
A Note on a Scale-Sensitive Dimension of Linear Bounded Functionals in Banach Spaces. ALT 1997: 352-363 - Tibor Hegedüs, Piotr Indyk:
On Learning Disjunctions of Zero-One Treshold Functions with Queries. ALT 1997: 446-460 - Eiju Hirowatari, Setsuo Arikawa:
Inferability of Recursive Real-Valued Functions. ALT 1997: 18-31 - Sanjay Jain, Steffen Lange, Jochen Nessel:
Learning of R.E. Languages from Good Examples. ALT 1997: 32-47 - Satoshi Kobayashi, Takashi Yokomori:
Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages. ALT 1997: 48-61 - Johannes Köbler, Wolfgang Lindner:
Oracles in Sigmap2 are Sufficient for Exact Learning. ALT 1997: 277-290 - Stephen Kwek:
Learning Disjunctions of Features. ALT 1997: 401-415 - Wolfgang Maass:
On the Relevance of Time in Neural Computation and Learning. ALT 1997: 364-384 - Satoshi Matsumoto, Yukiko Hayashi, Takayoshi Shoudai:
Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data. ALT 1997: 212-227 - Yasuhito Mukouchi:
Inferring a System from Examples with Time Passage. ALT 1997: 197-211 - Atsuyoshi Nakamura
:
An Efficient Exact Learning Algorithm for Ordered Binary Decision Diagrams. ALT 1997: 307-322 - Rajesh Parekh, Vasant G. Honavar
:
Learning DFA from Simple Examples. ALT 1997: 116-131 - Leonard Pitt:
On Exploiting Knowledge and Concept Use in Learning Theory. ALT 1997: 62-84 - Hongzhu Qiao, Nageswara S. V. Rao
, Vladimir A. Protopopescu:
PAC Learning Using Nadaraya-Watson Estimator Based on Orthonormal Systems. ALT 1997: 146-160 - Hiroshi Sakamoto:
Learning Simple Deterministic Finite-Memory Automata. ALT 1997: 416-431 - Masahiko Sato:
Classical Brouwer-Heyting-Kolmogorov Interpretation. ALT 1997: 176-196 - Meera Sitharam, Timothy Straney:
Deranomized Learning of Boolean Functions. ALT 1997: 100-115 - Eiji Takimoto, Ken'ichi Hirai, Akira Maruoka:
A Simple Algorithm for Predicting Nearly as Well as the Best Pruning Labeled with the Best Prediction Values of a Decision Tree. ALT 1997: 385-400 - V. G. Vovk:
Probability Theory for the Brier Game. ALT 1997: 323-338 - Xiaolong Zhang, Masayuki Numao:
Learning and Revising Theories in Noisy Domains. ALT 1997: 339-351
skipping 1 more match
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-18 06:00 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