![](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
- 2006
- Chamy Allenberg, Peter Auer, László Györfi, György Ottucsák:
Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring. ALT 2006: 229-243 - Alp Atici, Rocco A. Servedio:
Learning Unions of omega(1)-Dimensional Rectangles. ALT 2006: 32-47 - Frank J. Balbach, Thomas Zeugmann:
Teaching Memoryless Randomized Learners Without Feedback. ALT 2006: 93-108 - José L. Balcázar, Philip M. Long, Frank Stephan:
Editors' Introduction. ALT 2006: 1-9 - Matthew de Brecht, Akihiro Yamamoto:
Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data. ALT 2006: 124-138 - Nader H. Bshouty, Iddo Bentov:
On Exact Learning from Random Walk. ALT 2006: 184-198 - Nader H. Bshouty, Ehab Wattad:
On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle. ALT 2006: 48-62 - Jorge Castro:
How Many Query Superpositions Are Needed to Learn? ALT 2006: 78-92 - Eyal Even-Dar, Michael J. Kearns, Jennifer Wortman:
Risk-Sensitive Online Learning. ALT 2006: 199-213 - Stephen A. Fenner, William I. Gasarch:
The Complexity of Learning SUBSEQ (A). ALT 2006: 109-123 - Carole A. Goble, Óscar Corcho, Pinar Alper, David De Roure
:
e-Science and the Semantic Web: A Symbiotic Relationship. ALT 2006: 12 - Kohei Hatano:
Smooth Boosting Using an Information-Based Criterion. ALT 2006: 304-318 - Marcus Hutter
:
General Discounting Versus Average Reward. ALT 2006: 244-258 - Sanjay Jain, Efim B. Kinber:
Learning and Extending Sublanguages. ALT 2006: 139-153 - Sanjay Jain, Efim B. Kinber:
Iterative Learning from Positive Data and Negative Counterexamples. ALT 2006: 154-168 - Sanjay Jain, Steffen Lange, Sandra Zilles:
Towards a Better Understanding of Incremental Learning. ALT 2006: 169-183 - Matti Kääriäinen:
Active Learning in the Non-realizable Case. ALT 2006: 63-77 - Leonid Kontorovich, Corinna Cortes, Mehryar Mohri:
Learning Linearly Separable Languages. ALT 2006: 288-303 - Shane Legg:
Is There an Elegant Universal Theory of Prediction? ALT 2006: 274-287 - Hsuan-Tien Lin
, Ling Li:
Large-Margin Thresholded Ensembles for Ordinal Regression: Theory and Practice. ALT 2006: 319-333 - Andreas Maurer:
Unsupervised Slow Subspace-Learning from Stationary Processes. ALT 2006: 363-377 - Atsuyoshi Nakamura:
Learning-Related Complexity of Linear Ranking Functions. ALT 2006: 378-392 - Andrew Y. Ng:
Reinforcement Learning and Apprenticeship Learning for Robotic Control. ALT 2006: 29-31 - Jan Poland:
The Missing Consistency Theorem for Bayesian Learning: Stochastic Model Selection. ALT 2006: 259-273 - Gunnar Rätsch
:
Solving Semi-infinite Linear Programs Using Boosting-Like Methods. ALT 2006: 10-11 - Daniil Ryabko, Marcus Hutter
:
Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence. ALT 2006: 334-347 - Takeshi Shibata, Ryo Yoshinaka
, Takashi Chikayama:
Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning. ALT 2006: 348-362 - Hans Ulrich Simon
:
Spectral Norm in Learning Theory: Some Selected Topics. ALT 2006: 13-27 - Padhraic Smyth
:
Data-Driven Discovery Using Probabilistic Hidden Variable Models. ALT 2006: 28 - Vladimir Vovk:
Leading Strategies in Competitive On-Line Prediction. ALT 2006: 214-228
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-02 19: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