default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitry M. Malioutov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c15]Dmitry M. Malioutov, Sanjeeb Dash, Dennis Wei:
Heavy Sets with Applications to Interpretable Machine Learning Diagnostics. AISTATS 2023: 5918-5930- [c14]Dennis Wei, Dmitry M. Malioutov:
A Statistical Interpretation of the Maximum Subarray Problem. ICASSP 2023: 1-5
2010 – 2019
- 2017
- [i6]Been Kim, Dmitry M. Malioutov, Kush R. Varshney, Adrian Weller:
Proceedings of the 2017 ICML Workshop on Human Interpretability in Machine Learning (WHI 2017). CoRR abs/1708.02666 (2017) - 2016
- [j6]Dmitry M. Malioutov
, Aycan A. Corum, Müjdat Çetin:
Covariance Matrix Estimation for Interest-Rate Risk Modeling via Smooth and Monotone Regularization. IEEE J. Sel. Top. Signal Process. 10(6): 1006-1014 (2016) - [c13]Guolong Su, Dennis Wei, Kush R. Varshney, Dmitry M. Malioutov:
Learning sparse two-level boolean rules. MLSP 2016: 1-6 - [i5]Guolong Su, Dennis Wei, Kush R. Varshney, Dmitry M. Malioutov:
Interpretable Two-level Boolean Rule Learning for Classification. CoRR abs/1606.05798 (2016) - [i4]Been Kim, Dmitry M. Malioutov, Kush R. Varshney:
Proceedings of the 2016 ICML Workshop on Human Interpretability in Machine Learning (WHI 2016). CoRR abs/1607.02531 (2016) - 2015
- [c12]Sanjeeb Dash, Dmitry M. Malioutov, Kush R. Varshney:
Learning interpretable classification rules using sequential rowsampling. ICASSP 2015: 3337-3341 - [i3]Guolong Su, Dennis Wei, Kush R. Varshney, Dmitry M. Malioutov:
Interpretable Two-level Boolean Rule Learning for Classification. CoRR abs/1511.07361 (2015) - 2014
- [c11]Sanjeeb Dash, Dmitry M. Malioutov, Kush R. Varshney:
Screening for learning classification rules via Boolean compressed sensing. ICASSP 2014: 3360-3364 - 2013
- [c10]Dmitry M. Malioutov, Kush R. Varshney:
Exact Rule Learning via Boolean Compressed Sensing. ICML (3) 2013: 765-773 - 2012
- [c9]Dmitry M. Malioutov, Mikhail B. Malyutov:
Boolean compressed sensing: LP relaxation for group testing. ICASSP 2012: 3305-3308 - 2011
- [j5]Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Willsky:
Belief Propagation and LP Relaxation for Weighted Matching in General Graphs. IEEE Trans. Inf. Theory 57(4): 2203-2212 (2011) - 2010
- [j4]Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Willsky:
Sequential Compressed Sensing. IEEE J. Sel. Top. Signal Process. 4(2): 435-444 (2010) - [i2]Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Willsky:
Sequential Compressed Sensing. CoRR abs/1003.0219 (2010)
2000 – 2009
- 2008
- [b1]Dmitry M. Malioutov:
Approximate inference in Gaussian graphical models. Massachusetts Institute of Technology, Cambridge, MA, USA, 2008 - [j3]Dmitry M. Malioutov, Jason K. Johnson, Myung Jin Choi, Alan S. Willsky:
Low-Rank Variance Approximation in GMRF Models: Single and Multiscale Approaches. IEEE Trans. Signal Process. 56(10-1): 4621-4634 (2008) - [c8]Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Willsky:
Compressed sensing with sequential observations. ICASSP 2008: 3357-3360 - 2007
- [c7]Dmitry M. Malioutov, Jason K. Johnson, Alan S. Willsky:
GMRF Variance Approximation using Splicedwavelet Bases. ICASSP (3) 2007: 1101-1104 - [c6]Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Willsky:
Linear programming analysis of loopy belief propagation for weighted matching. NIPS 2007: 1273-1280 - [i1]Jason K. Johnson, Dmitry M. Malioutov, Alan S. Willsky:
Lagrangian Relaxation for MAP Estimation in Graphical Models. CoRR abs/0710.0013 (2007) - 2006
- [j2]Dmitry M. Malioutov, Jason K. Johnson, Alan S. Willsky:
Walk-Sums and Belief Propagation in Gaussian Graphical Models. J. Mach. Learn. Res. 7: 2031-2064 (2006) - [c5]Dmitry M. Malioutov, Jason K. Johnson, Alan S. Willsky:
Low-Rank Variance Estimation in Large-Scale Gmrf Models. ICASSP (3) 2006: 676-679 - 2005
- [j1]Dmitry M. Malioutov, Müjdat Çetin, Alan S. Willsky:
A sparse signal reconstruction perspective for source localization with sensor arrays. IEEE Trans. Signal Process. 53(8-2): 3010-3022 (2005) - [c4]Dmitry M. Malioutov, Müjdat Çetin, Alan S. Willsky:
Homotopy continuation for sparse signal representation. ICASSP (5) 2005: 733-736 - [c3]Jason K. Johnson, Dmitry M. Malioutov, Alan S. Willsky:
Walk-Sum Interpretation and Analysis of Gaussian Belief Propagation. NIPS 2005: 579-586 - 2004
- [c2]Dmitry M. Malioutov, Müjdat Çetin, Alan S. Willsky:
Optimal sparse representations in general overcomplete bases. ICASSP (2) 2004: 793-796 - 2002
- [c1]Müjdat Çetin, Dmitry M. Malioutov, Alan S. Willsky:
A variational technique for source localization based on a sparse signal reconstruction perspective. ICASSP 2002: 2965-2968
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:40 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:
