D. E. Fishkind

发表

Vertex nomination schemes for membership prediction

C. E. Priebe, C. Priebe, V. Lyzinski, 2013, 1312.2638.

The reset disambiguation policy for navigating stochastic obstacle fields

C. Priebe, V. Aksakalli, D. Fishkind, 2011 .

Sensor information monotonicity in disambiguation protocols

Xugang Ye, Carey E. Priebe, Donniell E. Fishkind, 2011, J. Oper. Res. Soc..

Efficient, optimal stochastic-action selection when limited by an action budget

Carey E. Priebe, Donniell E. Fishkind, John Blatz, 2010, Math. Methods Oper. Res..

On the Mark Information Monotonicity in Random Disambiguation Paths

Xugang Ye, Carey E. Priebe, Donniell E. Fishkind, 2008 .

Disambiguation Protocols Based on Risk Simulation

Carey E. Priebe, Vural Aksakalli, Donniell E. Fishkind, 2007, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

Protocols for stochastic shortest path problems with dynamic learning

V. Aksakalli, D. Fishkind, D. E. Fishkind, 2007 .

Adaptation of the Simulated Risk Disambiguation Protocol to a Discrete Setting ∗

C. Priebe, D. Fishkind, D. E. Fishkind, 2006 .

Random disambiguation paths for traversing a mapped hazard field

C. Priebe, C. Piatko, D. Fishkind, 2005 .

On a complete and sufficient statistic for the correlated Bernoulli random graph model

C. Priebe, V. Lyzinski, A. Athreya, 2020, 2002.09976.

Fast Approximate Quadratic Programming for Graph Matching

Carey E. Priebe, John M. Conroy, Donniell E. Fishkind, 2015, PloS one.

Graph Matching: Relax at Your Own Risk

Guillermo Sapiro, Carey E. Priebe, Donniell E. Fishkind, 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

Statistical Inference on Random Dot Product Graphs: a Survey

Carey E. Priebe, Donniell E. Fishkind, Daniel L. Sussman, 2017, J. Mach. Learn. Res..

The Moore-Penrose Generalized Inverse for Sums of Matrices

James Allen Fill, Donniell E. Fishkind, J. A. Fill, 1999, SIAM J. Matrix Anal. Appl..

Seeded graph matching

Carey E. Priebe, Donniell E. Fishkind, Vince Lyzinski, 2012, Pattern Recognit..

On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching

Carey E. Priebe, Donniell E. Fishkind, Vince Lyzinski, 2016, J. Mach. Learn. Res..

A Genus Bound for Digital Image Boundaries

Donniell E. Fishkind, Lowell Abrams, Lowell Abrams, 2005, SIAM J. Discret. Math..

The generalized spherical homeomorphism theorem for digital images

Carey E. Priebe, Donniell E. Fishkind, Lowell Abrams, 2004, IEEE Transactions on Medical Imaging.

Counting Spanning Trees of Threshold Graphs pdf

Donniell E. Fishkind, Stephen R. Chestnut, D. Fishkind, 2012, ArXiv.

A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs

Carey E. Priebe, Donniell E. Fishkind, Daniel L. Sussman, 2011, 1108.2228.

Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown

Carey E. Priebe, Donniell E. Fishkind, Daniel L. Sussman, 2012, SIAM J. Matrix Anal. Appl..

Seeded graph matching for correlated Erdös-Rényi graphs

Carey E. Priebe, Donniell E. Fishkind, Vince Lyzinski, 2014, J. Mach. Learn. Res..

New Inconsistencies in Infinite Utilitarianism: is Every World Good, Bad or Neutral?

J. Hamkins, B. Montero, D. E. Fishkind, 2002 .

Vertex nomination: The canonical sampling and the extended spectral nomination schemes

Henry Pao, Vince Lyzinski, Jordan Yoder, 2018, Comput. Stat. Data Anal..

The phantom alignment strength conjecture: practical use of graph matching alignment strength to indicate a meaningful graph match

Carey E. Priebe, Donniell E. Fishkind, Vince Lyzinski, 2021, Applied Network Science.

Alignment strength and correlation for graphs

Carey E. Priebe, Donniell E. Fishkind, Vince Lyzinski, 2018, Pattern Recognit. Lett..

Affine Isomorphism for Partially Ordered Sets

J. A. Fill, E. Scheinerman, D. Fishkind, 1998 .

Rank, term rank, and chromatic number

Andrei Kotlov, Donniell E. Fishkind, D. Fishkind, 2002, Discret. Math..

Large (Brain) Graph Matching via Fast Approximate Quadratic Programming

John M. Conroy, Eric T. Harley, R. J. Vogelstein, 2011, 1112.5507.

A consistent dot product embedding for stochastic blockmodel graphs

Carey E. Priebe, Donniell E. Fishkind, Daniel L. Sussman, 2011 .

On Phantom Alignment Strength

Eric W. Bridgeford, C. Priebe, V. Lyzinski, 2021 .

Fast Approximate Quadratic Programming for Large (Brain) Graph Matching

Eric T. Harley, R. J. Vogelstein, L. J. Podrazik, 2011 .