default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLukas Bruderer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c12]Federico Wadehn, Lukas Bruderer, Vijay Sahdeva, Hans-Andrea Loeliger:
New square-root and diagonalized Kalman smoothers. Allerton 2016: 1282-1290- [c11]Federico Wadehn, Lukas Bruderer, Justin Dauwels, Vijay Sahdeva, Hang Yu, Hans-Andrea Loeliger:
Outlier-insensitive Kalman smoothing and marginal message passing. EUSIPCO 2016: 1242-1246 - [c10]Hans-Andrea Loeliger, Lukas Bruderer, Hampus Malmberg
, Federico Wadehn, Nour Zalmai:
On sparsity by NUV-EM, Gaussian message passing, and Kalman smoothing. ITA 2016: 1-10 - [i2]Hans-Andrea Loeliger, Lukas Bruderer, Hampus Malmberg, Federico Wadehn, Nour Zalmai:
On Sparsity by NUV-EM, Gaussian Message Passing, and Kalman Smoothing. CoRR abs/1602.02673 (2016) - 2015
- [c9]Federico Wadehn, Lukas Bruderer, Daniel Waltisberg, T. Keresztfalvi, Hans-Andrea Loeliger:
Sparse-input Detection Algorithm with Applications in Electrocardiography and Ballistocardiography. BIOSIGNALS 2015: 21-30 - [c8]Salomon Diether, Lukas Bruderer, Andreas Streich, Hans-Andrea Loeliger:
Efficient blind estimation of subband reverberation time from speech in non-diffuse environments. ICASSP 2015: 743-747 - [c7]Nour Zalmai, Christian Kaeslin, Lukas Bruderer, Sarah Neff, Hans-Andrea Loeliger:
Gesture recognition from magnetic field measurements using a bank of linear state space models and local likelihood filtering. ICASSP 2015: 2569-2573 - [c6]Lukas Bruderer, Hampus Malmberg, Hans-Andrea Loeliger:
Deconvolution of weakly-sparse signals and dynamical-system identification by Gaussian message passing. ISIT 2015: 326-330 - 2014
- [j1]Christian Senning, Lukas Bruderer, Josua Hunziker, Andreas Burg:
A Lattice Reduction-Aided MIMO Channel Equalizer in 90 nm CMOS Achieving 720 Mb/s. IEEE Trans. Circuits Syst. I Regul. Pap. 61-I(6): 1860-1871 (2014) - [c5]Harald Kroll, Stefan Zwicky, Reto Odermatt, Lukas Bruderer, Andreas Burg, Qiuting Huang:
A signal processor for Gaussian message passing. ISCAS 2014: 1969-1972 - [c4]Lukas Bruderer, Hans-Andrea Loeliger, Nour Zalmai:
Local statistical models from deterministic state space models, likelihood filtering, and local typicality. ISIT 2014: 1106-1110 - [c3]Lukas Bruderer, Hans-Andrea Loeliger:
Estimation of sensor input signals that are neither bandlimited nor sparse. ITA 2014: 1-5 - [i1]Harald Kröll, Stefan Zwicky, Reto Odermatt, Lukas Bruderer, Andreas Burg, Qiuting Huang:
A Signal Processor for Gaussian Message Passing. CoRR abs/1404.3162 (2014) - 2010
- [c2]Lukas Bruderer, Christoph Studer, Markus Wenk, Dominik Seethaler, Andreas Burg:
VLSI implementation of a low-complexity LLL lattice reduction algorithm for MIMO detection. ISCAS 2010: 3745-3748 - [c1]Markus Wenk, Lukas Bruderer, Andreas Burg, Christoph Studer:
Area- and throughput-optimized VLSI architecture of sphere decoding. VLSI-SoC 2010: 189-194
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-05-08 21:43 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:
