Craig Dillabaugh

According to our database, Craig Dillabaugh authored at least 8 papers between 2004 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2017

I/O-Efficient Path Traversal in Succinct Planar Graphs.

Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh

Algorithmica, 2017

Enhancing Suricata intrusion detection system for cyber security in SCADA networks.

Kevin Wong, Craig Dillabaugh, Nabil Seddigh, Biswajit Nandy

Proceedings of the 30th IEEE Canadian Conference on Electrical and Computer Engineering, 2017

2013

External Memory Algorithms For Path Traversal in Graphs.

Craig Dillabaugh

CoRR, 2013

2012

Succinct and I/O Efficient Data Structures for Traversal in Trees.

Craig Dillabaugh, Meng He, Anil Maheshwari

Algorithmica, 2012

2011

Point Location in Well-Shaped Meshes Using Jump-and-Walk.

Jean-Lou De Carufel, Craig Dillabaugh, Anil Maheshwari

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

I/O efficient path traversal in well-shaped tetrahedral meshes.

Craig Dillabaugh

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

I/O and Space-Efficient Path Traversal in Planar Graphs.

Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2004

Landsat urban mapping based on a combined spectral-spatial methodology.

Bert Guindon, Ying Zhang, Craig Dillabaugh

Proceedings of the 2004 IEEE International Geoscience and Remote Sensing Symposium, 2004