![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 42 | William Hendrix, Matthew C. Schmidt, Paul Breimyer, Nagiza F. Samatova: Theoretical underpinnings for maximal clique enumeration on perturbed graphs. Theor. Comput. Sci. 411(26-28): 2520-2536 (2010) | |
| 39 | Patricia Brent, Nathan David Green, Paul Breimyer, Ramya Krishnamurthy, Nagiza F. Samatova: Systematic Evaluation of Convergence Criteria in Iterative Training for NLP. FLAIRS Conference 2009 | |
| 38 | Paul Breimyer, Guruprasad Kora, William Hendrix, Neil Shah, Nagiza F. Samatova: PR: Automatic parallelization of data-parallel statistical computing codes for R in hybrid multi-node and multi-core environments. IADIS AC (2) 2009: 28-32 | |
| 37 | Paul Breimyer, Guruprasad Kora, Nagiza F. Samatova: Web-Enabled R for Large-Scale Collaborative Data Mining: A Survey. IKE 2009: 615-621 | |
| 36 | Paul Breimyer, William Hendrix, Guruprasad Kora, Nagiza F. Samatova: pR: Lightweight, Easy-to-Use Middleware to Plugin Parallel Analytical Computing with R. IKE 2009: 667-673 | |
| 35 | Amit C. Awekar, Nagiza F. Samatova, Paul Breimyer: Incremental All Pairs Similarity Search for Varying Similarity Thresholds with Reduced I/O Overhead. IKE 2009: 687-693 | |
| 34 | William Hendrix, Matthew C. Schmidt, Paul Breimyer, Nagiza F. Samatova: On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs. KDD Workshop on Knowledge Discovery from Uncertain Data 2009: 48-56 | |
| 32 | Amit C. Awekar, Nagiza F. Samatova, Paul Breimyer: Incremental all pairs similarity search for varying similarity thresholds. SNAKDD 2009: 1 |
Selection of 8 from 67 records - Nagiza F. Samatova has 115 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page