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 271 matches
- 2015
- Yasin Abbasi-Yadkori, Peter L. Bartlett, Xi Chen, Alan Malek:
Large-Scale Markov Decision Problems with KL Control Cost and its Application to Crowdsourcing. ICML 2015: 1053-1062 - Alekh Agarwal, Léon Bottou:
A Lower Bound for the Optimization of Finite Sums. ICML 2015: 78-86 - Kook Jin Ahn, Graham Cormode, Sudipto Guha, Andrew McGregor, Anthony Wirth:
Correlation Clustering in Data Streams. ICML 2015: 2237-2246 - Miltiadis Allamanis, Daniel Tarlow, Andrew D. Gordon, Yi Wei:
Bimodal Modelling of Source Code and Natural Language. ICML 2015: 2123-2132 - Ehsan Amid, Antti Ukkonen:
Multiview Triplet Embedding: Learning Attributes in Multiple Maps. ICML 2015: 1472-1480 - Senjian An, Farid Boussaïd, Mohammed Bennamoun:
How Can Deep Rectifier Networks Achieve Linear Separability and Preserve Distances? ICML 2015: 514-523 - Oren Anava, Elad Hazan, Assaf Zeevi:
Online Time Series Prediction with Missing Data. ICML 2015: 2191-2199 - Megasthenis Asteris, Anastasios Kyrillidis, Alexandros G. Dimakis, Han-Gyol Yi, Bharath Chandrasekaran:
Stay on path: PCA along graph paths. ICML 2015: 1728-1736 - Haim Avron, Lior Horesh:
Community Detection Using Time-Dependent Personalized PageRank. ICML 2015: 1795-1803 - Necdet S. Aybat, Zi Wang, Garud Iyengar:
An Asynchronous Distributed Proximal Gradient Method for Composite Convex Optimization. ICML 2015: 2454-2462 - Stephen H. Bach, Bert Huang, Jordan L. Boyd-Graber, Lise Getoor:
Paired-Dual Learning for Fast Training of Latent Variable Hinge-Loss MRFs. ICML 2015: 381-390 - Olivier Bachem, Mario Lucic, Andreas Krause:
Coresets for Nonparametric Estimation - the Case of DP-Means. ICML 2015: 209-217 - Philip Bachman, Doina Precup:
Variational Generative Stochastic Networks with Collaborative Shaping. ICML 2015: 1964-1972 - Mohammad Taha Bahadori, David C. Kale, Yingying Fan, Yan Liu:
Functional Subspace Clustering with Application to Time Series. ICML 2015: 228-237 - Lu Bai, Luca Rossi, Zhihong Zhang, Edwin R. Hancock:
An Aligned Subtree Kernel for Weighted Graphs. ICML 2015: 30-39 - Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward:
The Power of Randomization: Distributed Submodular Maximization on Massive Datasets. ICML 2015: 1236-1244 - David Belanger, Sham M. Kakade:
A Linear Dynamical System Model for Text. ICML 2015: 833-842 - Alessio Benavoli, Giorgio Corani, Francesca Mangili, Marco Zaffalon:
A Bayesian nonparametric procedure for comparing algorithms. ICML 2015: 1264-1272 - Christopher Berlind, Ruth Urner:
Active Nearest Neighbors in Changing Environments. ICML 2015: 1870-1879 - Michael Betancourt:
The Fundamental Incompatibility of Scalable Hamiltonian Monte Carlo and Naive Data Subsampling. ICML 2015: 533-540 - Alina Beygelzimer, Satyen Kale, Haipeng Luo:
Optimal and Adaptive Algorithms for Online Boosting. ICML 2015: 2323-2331 - Katharina Blechschmidt, Joachim Giesen, Sören Laue:
Tracking Approximate Solutions of Parameterized Optimization Problems over Multi-Dimensional (Hyper-)Parameter Domains. ICML 2015: 438-447 - Avrim Blum, Moritz Hardt:
The Ladder: A Reliable Leaderboard for Machine Learning Competitions. ICML 2015: 1006-1014 - Charles Blundell, Julien Cornebise, Koray Kavukcuoglu, Daan Wierstra:
Weight Uncertainty in Neural Network. ICML 2015: 1613-1622 - Haitham Bou-Ammar, Rasul Tutunov, Eric Eaton:
Safe Policy Search for Lifelong Reinforcement Learning with Sublinear Regret. ICML 2015: 2361-2369 - Wacha Bounliphone, Arthur Gretton, Arthur Tenenhaus, Matthew B. Blaschko:
A low variance consistent test of relative dependency. ICML 2015: 20-29 - Christos Boutsidis, Prabhanjan Kambadur, Alex Gittens:
Spectral Clustering via the Power Method - Provably. ICML 2015: 40-48 - Alexandra Carpentier, Michal Valko:
Simple regret for infinitely many armed bandits. ICML 2015: 1133-1141 - Kai-Wei Chang, Akshay Krishnamurthy, Alekh Agarwal, Hal Daumé III, John Langford:
Learning to Search Better than Your Teacher. ICML 2015: 2058-2066 - Xiaojun Chang, Yi Yang, Eric P. Xing, Yaoliang Yu:
Complex Event Detection using Semantic Saliency and Nearly-Isotonic SVM. ICML 2015: 1348-1357
skipping 241 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-09-25 17:55 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