Todd P. Coleman - Citegraph

Author Info

Name	Affiliation	Papers
TODD P. COLEMAN	Department of Bioengineering, University of California at San Diego, La Jolla, CA, USA	30
Collaborators	Citations	PageRank
42	210	17.99
Referers	Referees	References
380	447	333

Search Limit

100447

Publications (30 rows)

Collaborators (42 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Learning Minimal Latent Directed Information Polytrees.	6	0.43	2016
Diffeomorphism Learning Via Relative Entropy Constrained Optimal Transport	0	0.34	2016
Bayesian Lasso In A Distributed Architecture	0	0.34	2015
An optimizer's approach to stochastic control problems with nonclassical information structures	12	1.11	2015
Dynamic and Succinct Statistical Analysis of Neuroscience Data	8	0.55	2014
Necessary and sufficient conditions for reliability of posterior matching in arbitrary dimensions	0	0.34	2014
Efficient Methods to Compute Optimal Tree Approximations of Directed Information Graphs	16	0.84	2013
Directed Information Graphs	8	0.57	2012
Learning Minimal Latent Directed Information Trees	4	0.51	2012
Clustering large networks of parametric dynamic generative models	1	0.37	2012
Estimating the directed information to infer causal relationships in ensemble neural spike train recordings	84	3.51	2011
Equivalence between minimal generative model graphs and directed information graphs.	13	0.99	2011
A minimal approach to causal inference on topologies with bounded indegree.	4	0.57	2011
A memoryless channel coding methodology for infinite-memory queuing timing channels.	0	0.34	2011
Finite Block-Length Achievable Rates For Queuing Timing Channels	3	0.39	2011
Equivalence between reliable feedback communication and nonlinear filter stability.	0	0.34	2011
Source coding with feedforward using the posterior matching scheme	1	0.35	2010
Mutual information saddle points in channels of exponential family type	1	0.41	2010
Introduction to the special issue on information theory in molecular biology and neuroscience	7	0.61	2010
A computationally efficient method for nonparametric modeling of neural spiking activity with point processes	7	0.55	2010
An analytic spatial filter and a hidden Markov model for enhanced information transfer rate in EEG-based brain computer interfaces	1	0.39	2010
On reversible Markov chains and maximization of directed information	6	0.51	2010
A stochastic control viewpoint on 'posterior matching'-style feedback communication schemes	3	0.41	2009
Joint source-channel coding for transmitting correlated sources over broadcast networks	2	0.39	2009
The parabigeminal nucleus as a recursive estimator	0	0.34	2009
A simple memoryless proof of the capacity of the exponential server timing channel	4	0.47	2009
Practical codes for queueing channels: An algebraic, state-space, message-passing approach	11	0.62	2008
Sparse graph codes and practical decoding algorithms for communicating over packet timings in networks	2	0.36	2008
A low-complexity universal scheme for rate-constrained distributed regression using a wireless sensor network	1	0.37	2008
A computationally efficient method for modeling neural spiking activity with point processes nonparametrically	5	0.69	2007