Остановите войну!
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 52 matches
- 2008
- Jacob D. Abernethy, Peter L. Bartlett, Alexander Rakhlin, Ambuj Tewari:
Optimal Stragies and Minimax Lower Bounds for Online Convex Games. COLT 2008: 415-424 - Jacob D. Abernethy, Elad Hazan, Alexander Rakhlin:
Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization. COLT 2008: 263-274 - Jacob D. Abernethy, Manfred K. Warmuth, Joel Yellin:
When Random Play is Optimal Against an Adversary. COLT 2008: 437-446 - Nir Ailon, Mehryar Mohri:
An Efficient Reduction of Ranking to Classification. COLT 2008: 87-98 - Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin:
Learning Acyclic Probabilistic Circuits Using Test Paths. COLT 2008: 169-180 - Maria-Florina Balcan, Avrim Blum, Nathan Srebro:
Improved Guarantees for Learning via Similarity Functions. COLT 2008: 287-298 - Maria-Florina Balcan, Steve Hanneke, Jennifer Wortman:
The True Sample Complexity of Active Learning. COLT 2008: 45-56 - Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, Sham M. Kakade, Alexander Rakhlin, Ambuj Tewari:
High-Probability Regret Bounds for Bandit Online Linear Optimization. COLT 2008: 335-342 - Shai Ben-David, Ulrike von Luxburg:
Relating Clustering Stability to Properties of Cluster Boundaries. COLT 2008: 379-390 - Shai Ben-David, Tyler Lu, Dávid Pál:
Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning. COLT 2008: 33-44 - Andrey Bernstein, Nahum Shimkin:
Adaptive Aggregation for Reinforcement Learning with Efficient Exploration: Deterministic Domains. COLT 2008: 323-334 - Eric Blais, Ryan O'Donnell, Karl Wimmer:
Polynomial Regression under Arbitrary Product Distributions. COLT 2008: 193-204 - Constantine Caramanis, Shie Mannor:
Learning in the Limit with Adversarial Disturbances. COLT 2008: 467-478 - Giovanni Cavallanti, Nicolò Cesa-Bianchi, Claudio Gentile:
Linear Algorithms for Online Multitask Classification. COLT 2008: 251-262 - Kamalika Chaudhuri, Andrew McGregor:
Finding Metric Structure in Information Theoretic Clustering. COLT 2008: 391-402 - Kamalika Chaudhuri, Satish Rao:
Learning Mixtures of Product Distributions Using Correlations and Independence. COLT 2008: 9-20 - Kamalika Chaudhuri, Satish Rao:
Beyond Gaussians: Spectral Methods for Learning Mixtures of Heavy-Tailed Distributions. COLT 2008: 21-32 - Sung-Soon Choi, Kyomin Jung, Jeong Han Kim:
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions. COLT 2008: 123-134 - Varsha Dani, Thomas P. Hayes, Sham M. Kakade:
Stochastic Linear Optimization under Bandit Feedback. COLT 2008: 355-366 - Thorsten Doliwa, Michael Kallweit, Hans Ulrich Simon:
Dimension and Margin Bounds for Reflection-invariant Kernels. COLT 2008: 157-168 - Vitaly Feldman:
On the Power of Membership Queries in Agnostic Learning. COLT 2008: 147-156 - Vitaly Feldman, Leslie G. Valiant:
The Learning Power of Evolution. COLT 2008: 513-514 - Parikshit Gopalan, Adam Kalai, Adam R. Klivans:
A Query Algorithm for Agnostically Learning DNF?. COLT 2008: 515-516 - Amy Greenwald, Zheng Li, Warren Schudy:
More Efficient Internal-Regret-Minimizing Algorithms. COLT 2008: 239-250 - Peter Grunwald:
The Catch-Up Phenomenon in Bayesian Inference. COLT 2008: 1-2 - András György, Gábor Lugosi, György Ottucsák:
On-line Sequential Bin Packing. COLT 2008: 447-454 - Robin Hanson:
Combinatorial Prediction Markets. COLT 2008: 3-4 - Elad Hazan, Satyen Kale:
Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs. COLT 2008: 57-68 - Sandra Zilles, Steffen Lange, Robert Holte, Martin Zinkevich:
Teaching Dimensions based on Cooperative Learning. COLT 2008: 135-146 - Kosuke Ishibashi, Kohei Hatano, Masayuki Takeda:
Online Learning of Maximum p-Norm Margin Classifiers with Bias. COLT 2008: 69-80
skipping 22 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-05-27 22:13 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