default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTim Marrinan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Maurice Kuschel, Tanuj Hasija, Timothy Marrinan:
Rademacher Complexity Regularization for Correlation-Based Multiview Representation Learning. ICASSP 2024: 6490-6494- [i4]Sinjini Banerjee, Tim Marrinan, Reilly Cannon, Tony Chiang, Anand D. Sarwate:
Measuring model variability using robust non-parametric testing. CoRR abs/2406.08307 (2024) - 2023
- [c9]Daniel Grey Wolnick, Shahana Ibrahim, Tim Marrinan, Xiao Fu:
Deep Learning from Noisy Labels via Robust Nonnegative Matrix Factorization-Based Design. CAMSAP 2023: 446-450 - [c8]Maurice Kuschel, Timothy Marrinan, Tanuj Hasija:
Geodesic-Based Relaxation For Deep Canonical Correlation Analysis. MLSP 2023: 1-6 - [i3]Sinjini Banerjee, Reilly Cannon, Tim Marrinan, Tony Chiang, Anand D. Sarwate:
Robust Nonparametric Hypothesis Testing to Understand Variability in Training Neural Networks. CoRR abs/2310.00541 (2023) - 2022
- [c7]Tanuj Hasija, Timothy Marrinan:
A GLRT for estimating the number of correlated components in sample-poor mCCA. EUSIPCO 2022: 2091-2095 - 2020
- [j1]Tanuj Hasija
, Timothy Marrinan, Christian Lameiro, Peter J. Schreier:
Determining the dimension and structure of the subspace correlated across multiple data sets. Signal Process. 176: 107613 (2020) - [c6]Timothy Marrinan, Nicolas Gillis:
Hyperspectral Unmixing with Rare Endmembers via Minimax Nonnegative Matrix Factorization. EUSIPCO 2020: 1015-1019 - [i2]Timothy Marrinan, Pierre-Antoine Absil, Nicolas Gillis:
On a minimum enclosing ball of a collection of linear subspaces. CoRR abs/2003.12455 (2020)
2010 – 2019
- 2019
- [c5]Christian Lameiro, Tanuj Hasija, Tim Marrinan, Peter J. Schreier:
Estimating the Number of Correlated Components Based on Random Projections. ICASSP 2019: 5152-5156 - [i1]Tanuj Hasija, Christian Lameiro, Timothy Marrinan, Peter J. Schreier:
Determining the Dimension and Structure of the Subspace Correlated Across Multiple Data Sets. CoRR abs/1901.11366 (2019) - 2018
- [c4]Tim Marrinan, Tanuj Hasija, Christian Lameiro, Peter J. Schreier:
Complete Model Selection in Multiset Canonical Correlation Analysis. EUSIPCO 2018: 1082-1086 - 2017
- [c3]Ignacio Santamaría, Javier Vía, Michael Kirby, Tim Marrinan, Chris Peterson, Louis Scharf:
Constrained subspace estimation via convex optimization. EUSIPCO 2017: 1200-1204 - 2014
- [c2]Tim Marrinan, Bruce A. Draper, J. Ross Beveridge, Michael Kirby, Chris Peterson:
Finding the Subspace Mean or Median to Fit Your Need. CVPR 2014: 1082-1089 - 2013
- [c1]Tim Marrinan, J. Ross Beveridge, Bruce A. Draper, Michael Kirby, Chris Peterson:
Flag Manifolds for the Characterization of Geometric Structure in Large Data Sets. ENUMATH 2013: 457-465
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-07 21:34 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:
