default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Sundin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c8]Martin Sundin, Arun Venkitaraman, Magnus Jansson, Saikat Chatterjee:
A connectedness constraint for learning sparse graphs. EUSIPCO 2017: 151-155- 2016
- [b2]Martin Sundin:
Bayesian methods for sparse and low-rank matrix problems. Royal Institute of Technology, Stockholm, Sweden, 2016 - [j4]Kezhi Li, Martin Sundin, Cristian R. Rojas, Saikat Chatterjee, Magnus Jansson:
Alternating strategies with internal ADMM for low-rank matrix reconstruction. Signal Process. 121: 153-159 (2016) - [j3]Martin Sundin
, Cristian R. Rojas, Magnus Jansson, Saikat Chatterjee:
Relevance Singular Vector Machine for Low-Rank Matrix Reconstruction. IEEE Trans. Signal Process. 64(20): 5327-5339 (2016) - [c7]Martin Sundin, Saikat Chatterjee, Magnus Jansson:
Bayesian Cramer-Rao bounds for factorized model based low rank matrix reconstruction. EUSIPCO 2016: 1227-1231 - 2015
- [c6]Adria Casamitjana, Martin Sundin, Prasanta Kumar Ghosh, Saikat Chatterjee:
Bayesian learning for time-varying linear prediction of speech. EUSIPCO 2015: 325-329 - [c5]Martin Sundin, Saikat Chatterjee, Magnus Jansson:
Bayesian learning for robust principal component analysis. EUSIPCO 2015: 2361-2365 - [c4]Martin Sundin, Saikat Chatterjee, Magnus Jansson:
Greedy minimization of l1-norm with high empirical success. ICASSP 2015: 3816-3820 - [i3]Martin Sundin, Cristian R. Rojas, Magnus Jansson, Saikat Chatterjee:
Bayesian Learning for Low-Rank matrix reconstruction. CoRR abs/1501.05740 (2015) - 2014
- [c3]Martin Sundin, Saikat Chatterjee, Magnus Jansson:
Combined modeling of sparse and dense noise improves Bayesian RVM. EUSIPCO 2014: 1841-1845 - [i2]Martin Sundin, Saikat Chatterjee, Magnus Jansson, Cristian R. Rojas:
Relevance Singular Vector Machine for low-rank matrix sensing. CoRR abs/1407.0013 (2014) - [i1]Kezhi Li, Martin Sundin, Cristian R. Rojas, Saikat Chatterjee, Magnus Jansson:
Alternating Strategies Are Good For Low-Rank Matrix Reconstruction. CoRR abs/1407.3410 (2014) - 2013
- [c2]Martin Sundin, Magnus Jansson, Saikat Chatterjee:
Conditional prior based lmmse estimation of sparse signals. EUSIPCO 2013: 1-5 - [c1]Martin Sundin, Dennis Sundman, Magnus Jansson:
Beamformers for sparse recovery. ICASSP 2013: 5920-5924 - 2012
- [j2]Dave Zachariah, Martin Sundin, Magnus Jansson, Saikat Chatterjee:
Alternating Least-Squares for Low-Rank Matrix Reconstruction. IEEE Signal Process. Lett. 19(4): 231-234 (2012)
2000 – 2009
- 2009
- [j1]Martin Sundin, Morten Fjeld:
Softly Elastic 6 DOF Input. Int. J. Hum. Comput. Interact. 25(7): 647-691 (2009) - 2001
- [b1]Martin Sundin:
Elastic computer input control in six degrees of freedom. ETH Zurich, Zürich, Switzerland, 2001
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 2025-01-28 23:35 CET 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:
