Остановите войну!
for scientists:
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 30 matches
- 2012
- Dmitry Adamskiy, Wouter M. Koolen, Alexey V. Chernov, Vladimir Vovk:
A Closer Look at Adaptive Regret. ALT 2012: 290-304 - Dana Angluin, James Aspnes, Aryeh Kontorovich:
On the Learnability of Shuffle Ideals. ALT 2012: 111-123 - Gábor Bartók, Csaba Szepesvári:
Partial Monitoring with Side Information. ALT 2012: 305-319 - Shai Ben-David, Ruth Urner:
On the Hardness of Domain Adaptation and the Utility of Unlabeled Target Samples. ALT 2012: 139-153 - Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann:
Editors' Introduction. ALT 2012: 1-11 - Toon Calders:
Recent Developments in Pattern Mining. ALT 2012: 34 - Alexandra Carpentier, Rémi Munos:
Minimax Number of Strata for Online Stratified Sampling Given Noisy Samples. ALT 2012: 229-244 - Hal Daumé III, Jeff M. Phillips, Avishek Saha, Suresh Venkatasubramanian:
Efficient Protocols for Distributed Classification and Optimization. ALT 2012: 154-168 - Christophe Costa Florêncio, Sicco Verwer:
Regular Inference as Vertex Coloring. ALT 2012: 81-95 - Ziyuan Gao, Frank Stephan:
Confident and Consistent Partial Learning of Recursive Functions. ALT 2012: 51-65 - Mrinalkanti Ghosh, Satyadev Nandakumar:
Predictive Complexity and Generalized Entropy Rate of Stationary Ergodic Processes. ALT 2012: 365-379 - Eyal Gofer, Yishay Mansour:
Lower Bounds on Individual Sequence Regret. ALT 2012: 275-289 - Peter Grünwald:
The Safe Bayesian - Learning the Learning Rate via the Mixability Gap. ALT 2012: 169-183 - Sanjay Jain, Efim B. Kinber:
Automatic Learning from Positive Data and Negative Counterexamples. ALT 2012: 66-80 - Sanjay Jain, Timo Kötzing, Frank Stephan:
Enlarging Learnable Classes. ALT 2012: 36-50 - Emilie Kaufmann, Nathaniel Korda, Rémi Munos:
Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis. ALT 2012: 199-213 - Wouter M. Koolen, Vladimir Vovk:
Buy Low, Sell High. ALT 2012: 335-349 - Tor Lattimore, Marcus Hutter:
PAC Bounds for Discounted MDPs. ALT 2012: 320-334 - Pascal Massart, Caroline Meynet:
Some Rates of Convergence for the Selected Lasso Estimator. ALT 2012: 17-33 - Mehryar Mohri, Andres Muñoz Medina:
New Analysis and Algorithm for Learning with Drifting Distributions. ALT 2012: 124-138 - Edward Moroshko, Koby Crammer:
Weighted Last-Step Min-Max Algorithm with Improved Sub-logarithmic Regret. ALT 2012: 245-259 - Ronald Ortner, Daniil Ryabko, Peter Auer, Rémi Munos:
Regret Bounds for Restless Markov Bandits. ALT 2012: 214-228 - Luc De Raedt:
Declarative Modeling for Machine Learning and Data Mining. ALT 2012: 12 - Lev Reyzin:
Data Stability in Clustering: A Closer Look. ALT 2012: 184-198 - Gilbert Ritschard:
Exploring Sequential Data. ALT 2012: 35 - Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles:
Sauer's Bound for a Notion of Teaching Complexity. ALT 2012: 96-110 - Shai Shalev-Shwartz:
Learnability beyond Uniform Convergence. ALT 2012: 13-16 - Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Kiyohito Nagano:
Online Prediction under Submodular Constraints. ALT 2012: 260-274 - Manfred K. Warmuth, Wojciech Kotlowski, Shuisheng Zhou:
Kernelization of Matrix Updates, When and How? ALT 2012: 350-364 - Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann:
Algorithmic Learning Theory - 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings. Lecture Notes in Computer Science 7568, Springer 2012, ISBN 978-3-642-34105-2 [contents]
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-05-27 22:16 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