Остановите войну!
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 77 matches
- 2009
- Armen E. Allahverdyan, Aram Galstyan:
On Maximum a Posteriori Estimation of Hidden Markov Processes. UAI 2009: 1-9 - Daniel Andrade, Bernhard Sick:
Lower Bound Bayesian Networks - An Efficient Inference of Lower Bounds on Probability Distributions in Bayesian Networks. UAI 2009: 10-18 - John Asmuth, Lihong Li, Michael L. Littman, Ali Nouri, David Wingate:
A Bayesian Sampling Approach to Exploration in Reinforcement Learning. UAI 2009: 19-26 - Arthur U. Asuncion, Max Welling, Padhraic Smyth, Yee Whye Teh:
On Smoothing and Inference for Topic Models. UAI 2009: 27-34 - Peter L. Bartlett, Ambuj Tewari:
REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs. UAI 2009: 35-42 - Kedar Bellare, Gregory Druck, Andrew McCallum:
Alternating Projections for Learning with Expectation Constraints. UAI 2009: 43-50 - Alina Beygelzimer, John Langford, Yury Lifshits, Gregory B. Sorkin, Alexander L. Strehl:
Conditional Probability Tree Estimation Analysis and Algorithms. UAI 2009: 51-58 - Blai Bonet:
Deterministic POMDPs Revisited. UAI 2009: 59-66 - Alexandre Bouchard-Côté, Michael I. Jordan:
Optimization of Structured Mean Field Objectives. UAI 2009: 67-74 - Jordan L. Boyd-Graber, David M. Blei:
Multilingual Topic Models for Unaligned Text. UAI 2009: 75-82 - David M. Bradley, J. Andrew Bagnell:
Convex Coding. UAI 2009: 83-90 - Ido Cohn, Tal El-Hay, Nir Friedman, Raz Kupferman:
Mean Field Variational Approximation for Continuous-Time Bayesian Networks. UAI 2009: 91-100 - Vincent Conitzer:
Prediction Markets, Mechanism Design, and Cooperative Game Theory. UAI 2009: 101-108 - Corinna Cortes, Mehryar Mohri, Afshin Rostamizadeh:
L2 Regularization for Learning Kernels. UAI 2009: 109-116 - Fábio Gagliardi Cozman, Rodrigo Bellizia Polastro:
Complexity Analysis and Variational Inference for Interpretation-based Probabilistic Description Logic. UAI 2009: 117-125 - Mark Crowley, John Nelson, David Poole:
Seeing the Forest Despite the Trees: Large Scale Spatial-Temporal Decision Making. UAI 2009: 126-134 - Hal Daumé III:
Bayesian Multitask Learning with Latent Hierarchies. UAI 2009: 135-142 - Finale Doshi-Velez, Zoubin Ghahramani:
Correlated Non-Parametric Latent Feature Models. UAI 2009: 143-150 - Miroslav Dudík, Geoffrey J. Gordon:
A Sampling-Based Approach to Computing Equilibria in Succinct Extensive-Form Games. UAI 2009: 151-160 - Yu Fan, Christian R. Shelton:
Learning Continuous-Time Social Network Dynamics. UAI 2009: 161-168 - Michael Finegold, Mathias Drton:
Robust Graphical Modeling with t-Distributions. UAI 2009: 169-176 - Christian Fritz, Sheila A. McIlraith:
Generating Optimal Plans in Highly-Dynamic Domains. UAI 2009: 177-184 - Kuzman Ganchev, Michael J. Kearns, Yuriy Nevmyvaka, Jennifer Wortman Vaughan:
Censored Exploration and the Dark Pool Problem. UAI 2009: 185-194 - Vicenç Gómez, Hilbert J. Kappen, Michael Chertkov:
Approximate inference on planar graphs using Loop Calculus and Belief Propagation. UAI 2009: 195-202 - Joseph Gonzalez, Yucheng Low, Carlos Guestrin, David R. O'Hallaron:
Distributed Parallel Inference on Large Factor Graphs. UAI 2009: 203-212 - Geoffrey J. Gordon, Sue Ann Hong, Miroslav Dudík:
First-Order Mixed Integer Linear Programming. UAI 2009: 213-222 - Matthias Hoffman, Hendrik Kück, Nando de Freitas, Arnaud Doucet:
New inference strategies for solving Markov Decision Processes using reversible jump MCMC. UAI 2009: 223-231 - Peter Hooper, Yasin Abbasi-Yadkori, Russell Greiner, Bret Hoehn:
Improved Mean and Variance Approximations for Belief Net Responses via Network Doubling. UAI 2009: 232-239 - Patrik O. Hoyer, Antti Hyttinen:
Bayesian Discovery of Linear Acyclic Causal Models. UAI 2009: 240-248 - Dominik Janzing, Jonas Peters, Joris M. Mooij, Bernhard Schölkopf:
Identifying confounders using additive noise models. UAI 2009: 249-257
skipping 47 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-23 17:27 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