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 263 matches
- 2009
- Yang Wang, Gholamreza Haffari, Shaojun Wang, Greg Mori:
A Rate Distortion Approach for Semi-Supervised Conditional Random Fields. NIPS 2009: 2008-2016 - Alekh Agarwal, Peter L. Bartlett, Pradeep Ravikumar, Martin J. Wainwright:
Information-theoretic lower bounds on the oracle complexity of convex optimization. NIPS 2009: 1-9 - Nir Ailon, Ragesh Jaiswal, Claire Monteleoni:
Streaming k-means approximation. NIPS 2009: 10-18 - Martin Allen, Shlomo Zilberstein:
Complexity of Decentralized Control: Special Cases. NIPS 2009: 19-27 - Massih-Reza Amini, Nicolas Usunier, Cyril Goutte:
Learning from Multiple Partially Observed Views - an Application to Multilingual Text Categorization. NIPS 2009: 28-36 - Roy Anati, Kostas Daniilidis:
Constructing Topological Maps using Markov Random Fields and Loop-Closure Detection. NIPS 2009: 37-45 - Sylvain Arlot, Francis R. Bach:
Data-driven calibration of linear estimators with minimal penalties. NIPS 2009: 46-54 - Raman Arora:
On Learning Rotations. NIPS 2009: 55-63 - Bing Bai, Jason Weston, David Grangier, Ronan Collobert, Kunihiko Sadamasa, Yanjun Qi, Corinna Cortes, Mehryar Mohri:
Polynomial Semantic Indexing. NIPS 2009: 64-72 - Cosmin Adrian Bejan, Matthew Titsworth, Andrew Hickl, Sanda M. Harabagiu:
Nonparametric Bayesian Models for Unsupervised Event Coreference Resolution. NIPS 2009: 73-81 - Samy Bengio, Fernando C. N. Pereira, Yoram Singer, Dennis Strelow:
Group Sparse Coding. NIPS 2009: 82-89 - Philipp Berens, Sebastian Gerwinn, Alexander S. Ecker, Matthias Bethge:
Neurometric function analysis of population codes. NIPS 2009: 90-98 - James Bergstra, Yoshua Bengio:
Slow, Decorrelated Features for Pretraining Complex Cell-like Networks. NIPS 2009: 99-107 - Pietro Berkes, Ben White, József Fiser:
No evidence for active sparsification in the visual cortex. NIPS 2009: 108-116 - Wei Bian, Dacheng Tao:
Manifold Regularization for SIR with Rate Root-n Convergence. NIPS 2009: 117-125 - Matthew B. Blaschko, Jacquelyn A. Shelton, Andreas M. Bartels:
Augmenting Feature-driven fMRI Analyses: Semi-supervised learning and resting state activity. NIPS 2009: 126-134 - Liefeng Bo, Cristian Sminchisescu:
Efficient Match Kernel between Sets of Features for Visual Recognition. NIPS 2009: 135-143 - Alexandre Bouchard-Côté, Slav Petrov, Dan Klein:
Randomized Pruning: Efficiently Calculating Expectations in Large Dynamic Programs. NIPS 2009: 144-152 - Christos Boutsidis, Michael W. Mahoney, Petros Drineas:
Unsupervised Feature Selection for the $k$-means Clustering Problem. NIPS 2009: 153-161 - Jake V. Bouvrie, Lorenzo Rosasco, Tomaso A. Poggio:
On Invariance in Hierarchical Models. NIPS 2009: 162-170 - Romain Brasselet, Roland S. Johansson, Angelo Arleo:
Optimal context separation of spiking haptic signals by second-order somatosensory neurons. NIPS 2009: 180-188 - Michael Brückner, Tobias Scheffer:
Nash Equilibria of Static Prediction Games. NIPS 2009: 171-179 - Samuel Rota Bulò, Marcello Pelillo:
A Game-Theoretic Approach to Hypergraph Clustering. NIPS 2009: 1571-1579 - Keith Bush, Joelle Pineau:
Manifold Embeddings for Model-Based Reinforcement Learning under Partial Observability. NIPS 2009: 189-197 - Ruben Coen Cagli, Peter Dayan, Odelia Schwartz:
Statistical Models of Linear and Nonlinear Contextual Interactions in Early Visual Processing. NIPS 2009: 369-377 - Chenghui Cai, Xuejun Liao, Lawrence Carin:
Learning to Explore and Exploit in POMDPs. NIPS 2009: 198-206 - William M. Campbell, Zahi N. Karam, Douglas E. Sturim:
Speaker Comparison with Inner Product Discriminant Functions. NIPS 2009: 207-215 - Peter Carbonetto, Matthew King, Firas Hamze:
A Stochastic approximation method for inference in probabilistic graphical models. NIPS 2009: 216-224 - Francois Caron, Arnaud Doucet:
Bayesian Nonparametric Models on Decomposable Graphs. NIPS 2009: 225-233 - Daniel R. Cavagnaro, Mark A. Pitt, Jay I. Myung:
Adaptive Design Optimization in Experiments with People. NIPS 2009: 234-242
skipping 233 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-21 22:01 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