default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMehdi Molkaraie
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c14]Mehdi Molkaraie:
The Exact Determinant of a Specific Class of Sparse Positive Definite Matrices. ISIT 2023: 1038-1043- [i14]Mehdi Molkaraie:
The Exact Determinant of a Specific Class of Sparse Positive Definite Matrices. CoRR abs/2311.06632 (2023) - 2022
- [j4]Mehdi Molkaraie:
Mappings for Marginal Probabilities with Applications to Models in Statistical Physics. J. Mach. Learn. Res. 23: 245:1-245:36 (2022) - [i13]Mehdi Molkaraie:
Mappings for Marginal Probabilities with Applications to Models in Statistical Physics. CoRR abs/2208.05333 (2022) - 2021
- [c13]Mehdi Molkaraie:
Duality for Continuous Graphical Models. ITW 2021: 1-6 - [i12]Mehdi Molkaraie:
Duality for Continuous Graphical Models. CoRR abs/2111.01938 (2021) - 2020
- [c12]Mehdi Molkaraie:
Marginal Densities, Factor Graph Duality, and High-Temperature Series Expansions. AISTATS 2020: 256-265
2010 – 2019
- 2019
- [i11]Mehdi Molkaraie:
Marginal Densities, Factor Graph Duality, and High-Temperature Series Expansions. CoRR abs/1901.02733 (2019) - 2018
- [j3]Mehdi Molkaraie
, Vicenç Gómez:
Monte Carlo Methods for the Ferromagnetic Potts Model Using Factor Graph Duality. IEEE Trans. Inf. Theory 64(12): 7449-7464 (2018) - 2017
- [c11]Mehdi Molkaraie:
The primal versus the dual ising model. Allerton 2017: 53-60 - 2016
- [i10]Mehdi Molkaraie:
An Importance Sampling Algorithm for Models with Weak Couplings. CoRR abs/1607.00866 (2016) - 2015
- [c10]Mehdi Molkaraie:
An importance sampling scheme for models in a strong external field. ISIT 2015: 1179-1183 - [i9]Mehdi Molkaraie, Vicenç Gómez:
Efficient Monte Carlo Methods for the Potts Model at Low Temperature. CoRR abs/1506.07044 (2015) - [i8]Mehdi Molkaraie:
An Importance Sampling Scheme for Models in a Strong External Field. CoRR abs/1512.08650 (2015) - 2014
- [i7]Mehdi Molkaraie:
An Importance Sampling Scheme on Dual Factor Graphs. I. Models in a Strong External Field. CoRR abs/1401.4912 (2014) - [i6]Mehdi Molkaraie:
An Importance Sampling Scheme on Dual Factor Graphs - II. Models with Strong Couplings. CoRR abs/1404.5666 (2014) - 2013
- [j2]Mehdi Molkaraie, Hans-Andrea Loeliger:
Monte Carlo Algorithms for the Partition Function and Information Rates of Two-Dimensional Channels. IEEE Trans. Inf. Theory 59(1): 495-503 (2013) - [c9]Mehdi Molkaraie, Hans-Andrea Loeliger:
Partition function of the Ising model via factor graph duality. ISIT 2013: 2304-2308 - [i5]Mehdi Molkaraie, Hans-Andrea Loeliger:
Partition Function of the Ising Model via Factor Graph Duality. CoRR abs/1307.3645 (2013) - 2012
- [j1]Giovanni Sabato, Mehdi Molkaraie:
Generalized Belief Propagation for the Noiseless Capacity and Information Rates of Run-Length Limited Constraints. IEEE Trans. Commun. 60(3): 669-675 (2012) - [c8]Mehdi Molkaraie, Hans-Andrea Loeliger:
Extending monte carlo methods to factor graphs with negative and complex factors. ITW 2012: 362-366 - [i4]Mehdi Molkaraie, Hans-Andrea Loeliger:
Extending Monte Carlo Methods to Factor Graphs with Negative and Complex Factors. CoRR abs/1206.5232 (2012) - 2011
- [i3]Giovanni Sabato, Mehdi Molkaraie:
Generalized Belief Propagation for the Noiseless Capacity and Information Rates of Run-Length Limited Constraints. CoRR abs/1101.3214 (2011) - [i2]Mehdi Molkaraie, Payam Pakzad:
On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function. CoRR abs/1103.0377 (2011) - [i1]Mehdi Molkaraie, Hans-Andrea Loeliger:
Monte Carlo Algorithms for the Partition Function and Information Rates of Two-Dimensional Channels. CoRR abs/1105.5542 (2011) - 2010
- [c7]Giovanni Sabato, Mehdi Molkaraie:
Generalized belief propagation algorithm for the capacity of multi-dimensional run-length limited constraints. ISIT 2010: 1213-1217 - [c6]Mehdi Molkaraie, Hans-Andrea Loeliger:
Estimating the information rate of noisy two-dimensional constrained channels. ISIT 2010: 1678-1682
2000 – 2009
- 2008
- [c5]Hans-Andrea Loeliger, Mehdi Molkaraie:
Simulation-based estimation of the partition function and the information rate of two-dimensional models. ISIT 2008: 1113-1117 - [c4]Mehdi Molkaraie, Payam Pakzad:
On properties of the minimum entropy sub-tree to compute lower bounds on the partition function. ISIT 2008: 2504-2507 - 2006
- [c3]Mehdi Molkaraie, Payam Pakzad:
Sub-tree Based Upper and Lower Bounds on the Partition Function. ISIT 2006: 2047-2051 - 2005
- [c2]Mehdi Molkaraie, Payam Pakzad:
On entropy decomposition and new bounds on the partition function. ISIT 2005: 1578-1582 - 2004
- [c1]Omid Etesami, Mehdi Molkaraie, Amin Shokrollahi:
Raptor codes on symmetric channels. ISIT 2004: 38
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-09-13 01:37 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:
