David J. Haglin

According to our database1, David J. Haglin authored at least 43 papers between 1991 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Big graph visual analytics.
Inf. Vis., 2017

Exploring DataVortex Systems for Irregular Applications.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

High-Performance Data Analytics Beyond the Relational and Graph Data Models with GEMS.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

2016
GraQL: A Query Language for High-Performance Attributed Graph Databases.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, 2016

Exploring Data Vortex Network Architectures.
Proceedings of the 24th IEEE Annual Symposium on High-Performance Interconnects, 2016

2015
In-Memory Graph Databases for Web-Scale Data.
Computer, 2015

A visual analytics paradigm enabling trillion-edge graph exploration.
Proceedings of the 5th IEEE Symposium on Large Data Analysis and Visualization, 2015

High-Performance, Distributed Dictionary Encoding of RDF Datasets.
Proceedings of the 2015 IEEE International Conference on Cluster Computing, 2015

GEMS: Graph Database Engine for Multithreaded Systems.
Proceedings of the Big Data - Algorithms, Analytics, and Applications., 2015

2014
Toward a data scalable solution for facilitating discovery of science resources.
Parallel Comput., 2014

Scaling Semantic Graph Databases in Size and Performance.
IEEE Micro, 2014

Optimizing graph queries with graph joins and Sprinkle SPARQL.
Proceedings of the 2014 IEEE International Conference on Big Data (IEEE BigData 2014), 2014

2013
Composing Data Parallel Code for a SPARQL Graph Engine.
Proceedings of the International Conference on Social Computing, SocialCom 2013, 2013

Massive scale cyber traffic analysis: a driver for graph database research.
Proceedings of the First International Workshop on Graph Data Management Experiences and Systems, 2013

Toward a data scalable solution for facilitating discovery of scientific data resources.
Proceedings of the 2013 International Workshop on Data-Intensive Scalable Computing Systems, 2013

Combining Structure and Property Values is Essential for Graph-Based Learning.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

Scalable, Multithreaded, Partially-in-Place Sorting.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

Accelerating semantic graph databases on commodity clusters.
Proceedings of the 2013 IEEE International Conference on Big Data (IEEE BigData 2013), 2013

2012
Towards Efficient N-x Contingency Selection Using Group betweenness Centrality.
Proceedings of the 2012 SC Companion: High Performance Computing, 2012

DisClose: Discovering Colossal Closed Itemsets via a Memory Efficient Compact Row-Tree.
Proceedings of the Emerging Trends in Knowledge Discovery and Data Mining - PAKDD 2012 International Workshops: DMHM, GeoDoc, 3Clust, and DSDM, Kuala Lumpur, Malaysia, May 29, 2012

Feature Clustering for Accelerating Parallel Coordinate Descent.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Scaling Up Coordinate Descent Algorithms for Large <i>ℓ<sub>1</sub></i> Regularization Problems.
Proceedings of the 29th International Conference on Machine Learning, 2012

2011
Techniques for Improving Filters in Power Grid Contingency Analysis.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2011

Toward Parallel Document Clustering.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

High-Performance Computing Applied to Semantic Databases.
Proceedings of the Semanic Web: Research and Applications, 2011

2010
Hashing strategies for the Cray XMT.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2009
Factors affecting the performance of parallel mining of minimal unique itemsets on diverse architectures.
Concurr. Comput. Pract. Exp., 2009

2008
A recursive search algorithm for statistical disclosure assessment.
Data Min. Knowl. Discov., 2008

Variable-grain and dynamic work generation for Minimal Unique Itemset mining.
Proceedings of the 2008 IEEE International Conference on Cluster Computing, 29 September, 2008

2007
Towards Average Case Analysis of Itemset Mining.
Proceedings of the 2007 International Conference on Data Mining, 2007

On Minimal Infrequent Itemset Mining.
Proceedings of the 2007 International Conference on Data Mining, 2007

2005
A tool for public analysis of scientific data.
Data Sci. J., 2005

A New Algorithm for Finding Minimal Sample Uniques for Use in Statistical Disclosure Assessment.
Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 2005

2001
The Message-Minimizing Load Redistribution Problem.
J. Univers. Comput. Sci., 2001

2000
Technical Report Column.
SIGACT News, 2000

1999
An Optimal Algorithm for Finding All Convex Subsets in Tournaments.
Ars Comb., 1999

1996
On Convex Subsets in Tournaments.
SIAM J. Discret. Math., 1996

1995
Bipartite Expander Matching is in NC.
Parallel Process. Lett., 1995

A Massively Parallel Transportation Solution.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1995

1993
Approximating Matchings in Parallel.
Inf. Process. Lett., 1993

1992
Approximating Maximum 2-CNF Satisfiability.
Parallel Process. Lett., 1992

1991
Approximation and Intractability Results for the Maximum Cut Problem and its Variants.
IEEE Trans. Computers, 1991

On a fast deterministic parallel approximate matching algorithm.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991


  Loading...