Classification Using Class Cover Catch Digraphs CEPDJ Marchette, JGDVDA Socolinsky Journal of Classification 20, 3-23, 2003 | 94 | 2003 |
On the distribution of the domination number for random class cover catch digraphs CE Priebe, JG DeVinney, DJ Marchette Statistics & Probability Letters 55 (3), 239-246, 2001 | 59 | 2001 |
Random walks and catch digraphs in classification J DeVinney, CE Priebe, DJ Marchette, D Socolinsky Computing Science and Statistics 34, 107-117, 2002 | 38 | 2002 |
An efficient network flow code for finding all minimum cost s–t cutsets ND Curet, J DeVinney, ME Gaston Computers & Operations Research 29 (3), 205-219, 2002 | 34 | 2002 |
A new family of proximity graphs: Class cover catch digraphs J DeVinney, CE Priebe Discrete Applied Mathematics 154 (14), 1975-1982, 2006 | 25 | 2006 |
The class cover problem and its applications in pattern recognition JG DeVinney The Johns Hopkins University, 2003 | 25 | 2003 |
A SLLN for a one-dimensional class cover problem J DeVinney, JC Wierman Statistics & probability letters 59 (4), 425-435, 2002 | 18 | 2002 |
Conveyors for streaming many-to-many communication FM Maley, JG DeVinney 2019 IEEE/ACM 9th Workshop on Irregular Applications: Architectures and …, 2019 | 14 | 2019 |
A boosted cccd classifier for fast face detection DA Socolinsky, JD Neuheisel, CE Priebe, D Marchette, JG DeVinney Computing Science and Statistics 35, 2003 | 7 | 2003 |
Class cover catch digraphs J DeVinney, C Priebe submitted for publication, 2001 | 6 | 2001 |
A unified runtime for pgas and event-driven programming SR Paul, K Chen, A Hayashi, M Grossman, V Sarkar, J DeVinney, ... 2018 IEEE/ACM 4th International Workshop on Extreme Scale Programming Models …, 2018 | 3 | 2018 |
Yasugi, Masahiro 9 Yelick, Katherine 17 Yoritaka, Hiroshi 9 Young, Jeff 67 M Zubair, LAR Capelli, Y Chen, JG DeVinney, B Diskin, N Doucet, J Fox, ... | | |
IA3 2019 FM Maley, JG DeVinney, R Nakashima, H Yoritaka, M Yasugi | | |