default search action
Andrew Gelfand
Person information
- affiliation: University of California, Irvine, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j1]Sungsoo Ahn
, Michael Chertkov
Maximum Weight Matching Using Odd-Sized Cycles: Max-Product Belief Propagation and Half-Integrality. IEEE Trans. Inf. Theory 64(3): 1471-1480 (2018) - 2016
- [c12]Rose Yu, Andrew Gelfand, Suju Rajan, Cyrus Shahabi, Yan Liu:
Geographic Segmentation via Latent Poisson Factor Model. WSDM 2016: 357-366 - 2013
- [c11]Andrew E. Gelfand, Jinwoo Shin, Michael Chertkov
Belief Propagation for Linear Programming. ISIT 2013: 2249-2253 - [c10]Jinwoo Shin, Andrew E. Gelfand, Michael Chertkov:
A Graphical Transformation for Belief Propagation: Maximum Weight Matchings and Odd-Sized Cycles. NIPS 2013: 2022-2030 - [i6]Andrew Gelfand, Jinwoo Shin, Michael Chertkov:
Belief Propagation for Linear Programming. CoRR abs/1305.4130 (2013) - [i5]Jinwoo Shin, Andrew E. Gelfand, Michael Chertkov:
A Graphical Transformation for Belief Propagation: Maximum Weight Matchings and Odd-Sized Cycles. CoRR abs/1306.1167 (2013) - [i4]Michael Chertkov, Andrew Gelfand, Jinwoo Shin:
Loop Calculus and Bootstrap-Belief Propagation for Perfect Matchings on Arbitrary Graphs. CoRR abs/1306.1267 (2013) - 2012
- [c9]Andrew Gelfand, Max Welling:
Generalized Belief Propagation on Tree Robust Structured Region Graphs. UAI 2012: 296-305 - [c8]Max Welling, Andrew Gelfand, Alexander Ihler:
A Cluster-Cumulant Expansion at the Fixed Points of Belief Propagation. UAI 2012: 883-892 - [i3]Kalev Kask, Rina Dechter, Andrew Gelfand:
BEEM : Bucket Elimination with External Memory. CoRR abs/1203.3487 (2012) - [i2]Andrew Gelfand, Max Welling:
Generalized Belief Propagation on Tree Robust Structured Region Graphs. CoRR abs/1210.4857 (2012) - [i1]Max Welling, Andrew E. Gelfand, Alexander Ihler:
A Cluster-Cumulant Expansion at the Fixed Points of Belief Propagation. CoRR abs/1210.4916 (2012) - 2011
- [c7]Kalev Kask, Andrew Gelfand, Lars Otten, Rina Dechter:
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models. AAAI 2011: 54-60 - [c6]Andrew Gelfand, Kalev Kask, Rina Dechter:
Stopping Rules for Randomized Greedy Triangulation Schemes. AAAI 2011: 1043-1048 - [c5]Yutian Chen, Andrew Gelfand, Charless C. Fowlkes
Integrating local classifiers through nonlinear dynamics on label graphs with an application to image segmentation. ICCV 2011: 2635-2642 - 2010
- [c4]Andrew Gelfand, Yutian Chen, Laurens van der Maaten, Max Welling:
On Herding and the Perceptron Cycling Theorem. NIPS 2010: 694-702 - [c3]Kalev Kask, Rina Dechter, Andrew Gelfand:
BEEM : Bucket Elimination with External Memory. UAI 2010: 268-276
2000 – 2009
- 2009
- [c2]Andrew E. Gelfand, Christopher Smith, Mike Colony, Christopher Bowman:
Performance evaluation of decentralized estimation systems with uncertain communication. FUSION 2009: 786-793 - 2007
- [c1]K. David Lee, Andrew E. Gelfand, Eric Wiesenfeld, Brian Stepnitz:
Introduction of the hybrid inference tool (HIT). FUSION 2007: 1-7
Coauthor Index
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.
last updated on 2024-08-08 19:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: