default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew T. Harrison
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c4]Evan M. Dastin-van Rijn
, Nicole R. Provenza, Matthew T. Harrison, David A. Borton:
How do packet losses affect measures of averaged neural signalsƒ. EMBC 2021: 941-944- 2020
- [j9]Michael C. Burkhart, David M. Brandman, Brian Franco, Leigh R. Hochberg, Matthew T. Harrison:
The Discriminative Kalman Filter for Bayesian Filtering with Nonlinear and Nongaussian Observation Models. Neural Comput. 32(5): 969-1017 (2020)
2010 – 2019
- 2018
- [j8]David M. Brandman, Michael C. Burkhart, Jessica N. Kelemen, Brian Franco, Matthew T. Harrison, Leigh R. Hochberg:
Robust Closed-Loop Control of a Cursor in a Person with Tetraplegia using Gaussian Process Regression. Neural Comput. 30(11) (2018) - 2015
- [j7]Matthew T. Harrison, Asohan Amarasingham, Wilson Truccolo:
Spatiotemporal Conditional Inference and Hypothesis Tests for Neural Ensemble Spiking Precision. Neural Comput. 27(1): 104-150 (2015) - 2014
- [j6]Jeffrey W. Miller, Matthew T. Harrison:
Inconsistency of Pitman-Yor process mixtures for the number of components. J. Mach. Learn. Res. 15(1): 3333-3370 (2014) - [r1]Matthew T. Harrison:
Significance Evaluation. Encyclopedia of Computational Neuroscience 2014 - 2013
- [j5]Matthew T. Harrison:
Accelerated Spike Resampling for Accurate Multiple Testing Controls. Neural Comput. 25(2): 418-449 (2013) - [c3]Jeffrey W. Miller, Matthew T. Harrison:
A simple example of Dirichlet process mixture inconsistency for the number of components. NIPS 2013: 199-206 - 2011
- [i3]Jeffrey W. Miller, Matthew T. Harrison:
Exact Enumeration and Sampling of Matrices with Specified Margins. CoRR abs/1104.0323 (2011)
2000 – 2009
- 2009
- [j4]Matthew T. Harrison, Stuart Geman:
A Rate and History-Preserving Resampling Algorithm for Neural Spike Trains. Neural Comput. 21(5): 1244-1258 (2009) - 2008
- [j3]Matthew T. Harrison:
The Generalized Asymptotic Equipartition Property: Necessary and Sufficient Conditions. IEEE Trans. Inf. Theory 54(7): 3211-3216 (2008) - [j2]Matthew T. Harrison, Ioannis Kontoyiannis:
Estimation of the Rate-Distortion Function. IEEE Trans. Inf. Theory 54(8): 3757-3762 (2008) - 2007
- [i2]Matthew T. Harrison:
The Generalized Asymptotic Equipartition Property: Necessary and Sufficient Conditions. CoRR abs/0711.2666 (2007) - [i1]Matthew T. Harrison, Ioannis Kontoyiannis:
Estimation of the Rate-Distortion Function. CoRR abs/cs/0702018 (2007) - 2006
- [c2]Matthew T. Harrison, Ioannis Kontoyiannis:
On Estimating the Rate-Distortion Function. ISIT 2006: 267-271 - 2004
- [c1]Mokshay Madiman, Matthew T. Harrison, Ioannis Kontoyiannis:
Minimum description length vs. maximum likelihood in lossy data compression. ISIT 2004: 461
1990 – 1999
- 1995
- [j1]Paul K. Stockmeyer, C. Douglass Bateman, James W. Clark, Cyrus R. Eyster, Matthew T. Harrison, Nicholas A. Loehr, Patrick J. Rodriguez, Joseph R. Simmons III:
Exchanging disks in the tower of hanoi. Int. J. Comput. Math. 59(1-2): 37-47 (1995)
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-06-14 19:03 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:
