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 404 matches
- 2015
- Emmanuel Abbe, Colin Sandon:
Recovering Communities in the General Stochastic Block Model Without Knowing the Parameters. NIPS 2015: 676-684 - Abbas Abdolmaleki, Rudolf Lioutikov, Jan Peters, Nuno Lau, Luís Paulo Reis, Gerhard Neumann:
Model-Based Relative Entropy Stochastic Search. NIPS 2015: 3537-3545 - Jacob D. Abernethy, Chansoo Lee, Ambuj Tewari:
Fighting Bandits with a New Kind of Smoothness. NIPS 2015: 2197-2205 - Jayadev Acharya, Constantinos Daskalakis, Gautam Kamath:
Optimal Testing for Properties of Distributions. NIPS 2015: 3591-3599 - Ehsan Adeli-Mosabbeb, Kim-Han Thung, Le An, Feng Shi, Dinggang Shen:
Robust Feature-Sample Linear Discriminant Analysis for Brain Disorders Diagnosis. NIPS 2015: 658-666 - Hadi Mohasel Afshar, Justin Domke:
Reflection, Refraction, and Hamiltonian Monte Carlo. NIPS 2015: 3007-3015 - Sungsoo Ahn, Sejun Park, Michael Chertkov, Jinwoo Shin:
Minimum Weight Perfect Matching via Blossom Belief Propagation. NIPS 2015: 1288-1296 - Ibrahim M. Alabdulmohsin:
Algorithmic Stability and Uniform Generalization. NIPS 2015: 19-27 - Ahmed El Alaoui, Michael W. Mahoney:
Fast Randomized Kernel Ridge Regression with Statistical Guarantees. NIPS 2015: 775-783 - Dan Alistarh, Jennifer Iglesias, Milan Vojnovic:
Streaming Min-max Hypergraph Partitioning. NIPS 2015: 1900-1908 - Oren Anava, Elad Hazan, Shie Mannor:
Online Learning for Adversaries with Memory: Price of Past Mistakes. NIPS 2015: 784-792 - Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt:
Practical and Optimal LSH for Angular Distance. NIPS 2015: 1225-1233 - Jacob Andreas, Maxim Rabinovich, Michael I. Jordan, Dan Klein:
On the Accuracy of Self-Normalized Log-Linear Models. NIPS 2015: 1783-1791 - Yossi Arjevani, Ohad Shamir:
Communication Complexity of Distributed Convex Learning and Optimization. NIPS 2015: 1756-1764 - Megasthenis Asteris, Dimitris S. Papailiopoulos, Alexandros G. Dimakis:
Orthogonal NMF through Subspace Exploration. NIPS 2015: 343-351 - Megasthenis Asteris, Dimitris S. Papailiopoulos, Anastasios Kyrillidis, Alexandros G. Dimakis:
Sparse PCA via Bipartite Matchings. NIPS 2015: 766-774 - Julien Audiffren, Liva Ralaivola:
Cornering Stationary and Restless Mixing Bandits with Remix-UCB. NIPS 2015: 3339-3347 - Pranjal Awasthi, Andrej Risteski:
On some provably correct cases of variational inference for topic models. NIPS 2015: 2098-2106 - Jimmy Ba, Ruslan Salakhutdinov, Roger B. Grosse, Brendan J. Frey:
Learning Wake-Sleep Recurrent Attention Models. NIPS 2015: 2593-2601 - Philip Bachman, Doina Precup:
Data Generation as Sequential Decision Making. NIPS 2015: 3249-3257 - Sohail Bahmani, Justin K. Romberg:
Efficient Compressive Phase Retrieval with Constrained Sensing Vectors. NIPS 2015: 523-531 - Anoop Korattikara Balan, Vivek Rathod, Kevin P. Murphy, Max Welling:
Bayesian dark knowledge. NIPS 2015: 3438-3446 - Akshay Balsubramani, Yoav Freund:
Scalable Semi-Supervised Aggregation of Classifiers. NIPS 2015: 1351-1359 - Siddhartha Banerjee, Peter Lofgren:
Fast Bidirectional Probability Estimation in Markov Models. NIPS 2015: 1423-1431 - Rémi Bardenet, Michalis K. Titsias:
Inference for determinantal point processes without spectral knowledge. NIPS 2015: 3393-3401 - Elias Bareinboim, Andrew Forney, Judea Pearl:
Bandits with Unobserved Confounders: A Causal Approach. NIPS 2015: 1342-1350 - Jessa Bekker, Jesse Davis, Arthur Choi, Adnan Darwiche, Guy Van den Broeck:
Tractable Learning for Complex Probability Queries. NIPS 2015: 2242-2250 - Samy Bengio, Oriol Vinyals, Navdeep Jaitly, Noam Shazeer:
Scheduled Sampling for Sequence Prediction with Recurrent Neural Networks. NIPS 2015: 1171-1179 - Mathias Berglund, Tapani Raiko, Mikko Honkala, Leo Kärkkäinen, Akos Vetek, Juha Karhunen:
Bidirectional Recurrent Neural Networks as Generative Models. NIPS 2015: 856-864 - Alina Beygelzimer, Elad Hazan, Satyen Kale, Haipeng Luo:
Online Gradient Boosting. NIPS 2015: 2458-2466
skipping 374 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 2025-01-31 13:14 CET 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