Works Published in 2018

search works

copy embed code
Copy Embed Code Experiment

You can embed this resource into your own website. To do so, either use the code generated by us, or use the link and tweak the rest to your preferences. Copy the respective code or link below.

Displaying works 1 - 20 of 30 in total

Sorted by most recent date added to the index first, which may not be the same as publication date order.

2018 conference paper

A practical fpt algorithm for flow decomposition and transcript assembly

Proceedings of the Workshop on Algorithm Engineering and Experiments, 2018-January, 75–86.

By: K. Kloster, P. Kuinke, M. O?Brien, F. Reidl, F. Villaamil, B. Sullivan*, A. Van Der Poel

Contributors: K. Kloster, P. Kuinke, M. O’Brien, F. Reidl, F. Villaamil, B. Sullivan*, A. Van Der Poel

Source: ORCID
Added: August 6, 2022

2018 article

Structural rounding: Approximation algorithms for graphs near an algorithmically tractable class

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85094277709&partnerID=MN8TOARS

By: E. Demaine, T. Goodrich, K. Kloster, B. Lavallee, Q. Liu, B. Sullivan, A. Vakilian, A. Poel

Contributors: E. Demaine, T. Goodrich, K. Kloster, B. Lavallee, Q. Liu, B. Sullivan, A. Vakilian, A. Poel

Source: ORCID
Added: August 6, 2022

2018 article

Mining maximal induced bicliques using odd cycle transversals

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85093320378&partnerID=MN8TOARS

By: K. Kloster, B. Sullivan & A. Van Der Poel

Contributors: K. Kloster, B. Sullivan & A. Van Der Poel

Source: ORCID
Added: August 6, 2022

2018 article

Benchmarking treewidth as a practical component of tensor-network–based quantum simulation

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85095245427&partnerID=MN8TOARS

By: E. Dumitrescu, A. Fisher, T. Goodrich, T. Humble, B. Sullivan & A. Wrigh

Contributors: E. Dumitrescu, A. Fisher, T. Goodrich, T. Humble, B. Sullivan & A. Wrigh

Source: ORCID
Added: August 6, 2022

2018 article

An updated experimental evaluation of graph bipartization methods

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85104339918&partnerID=MN8TOARS

By: T. Goodrich, E. Horton & B. Sullivan

Contributors: T. Goodrich, E. Horton & B. Sullivan

Source: ORCID
Added: August 6, 2022

2018 article

Subgraph centrality and walk-regularity

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85093754399&partnerID=MN8TOARS

By: E. Horton, K. Kloster & B. Sullivan

Contributors: E. Horton, K. Kloster & B. Sullivan

Source: ORCID
Added: August 6, 2022

2018 article

Polynomial treedepth bounds in linear colorings

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85092833264&partnerID=MN8TOARS

By: J. Kun, M. O’Brien, M. Pilipczuk & B. Sullivan

Contributors: J. Kun, . M.P. O'Brien, M. Pilipczuk & B. Sullivan

Source: ORCID
Added: August 6, 2022

2018 report

Inter-Disciplinary Research Challenges in Computer Systems for the 2020s

National Science Foundation.

By: A. Cohen, X. Shen, J. Torrellas, J. Tuck & Y. Zhou

Source: NC State University Libraries
Added: June 17, 2022

2018 journal article

Optimizing adiabatic quantum program compilation using a graph-theoretic framework

Quantum Information Processing, 17(5).

co-author countries: United States of America 🇺🇸
Sources: Crossref, ORCID
Added: February 5, 2020

2018 chapter

Treedepth Bounds in Linear Colorings

In Graph-Theoretic Concepts in Computer Science: Vol. 11159 LNCS (pp. 331–343).

By: J. Kun*, M. O’Brien n & B. Sullivan n

co-author countries: United States of America 🇺🇸

Contributors: J. Kun*, M. O’Brien n & B. Sullivan n

Sources: Crossref, ORCID
Added: February 5, 2020

2018 conference paper

Zwift

Proceedings of the 2018 International Conference on Supercomputing - ICS '18. Presented at the the 2018 International Conference.

co-author countries: Switzerland 🇨🇭 China 🇨🇳 United States of America 🇺🇸

Event: the 2018 International Conference

author keywords: Compilers; Domain Specific Languages; Text Analytics
Sources: Crossref, ORCID
Added: January 25, 2020

2018 conference paper

Exploring Flexible Communications for Streamlining DNN Ensemble Training Pipelines

SC18: International Conference for High Performance Computing, Networking, Storage and Analysis. Presented at the SC18: International Conference for High Performance Computing, Networking, Storage and Analysis.

By: R. Pittman n, H. Guan n, X. Shen n, S. Lim* & R. Patton*

co-author countries: United States of America 🇺🇸

Event: SC18: International Conference for High Performance Computing, Networking, Storage and Analysis

Sources: Crossref, ORCID
Added: January 25, 2020

2018 journal article

Resolving the GPU responsiveness dilemma through program transformations

Frontiers of Computer Science, 12(3), 545–559.

co-author countries: China 🇨🇳 United States of America 🇺🇸
author keywords: program transformation; GPU; integrated architecture; responsiveness
Sources: Crossref, ORCID
Added: January 25, 2020

2018 article

Reuse-Centric K-Means Configuration

2018 IEEE 34TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), pp. 1224–1227.

By: H. Guan n, Y. Ding n, X. Shen n & H. Krim n

co-author countries: United States of America 🇺🇸
Sources: Web Of Science, ORCID
Added: November 11, 2019

2018 article

Footprint Modeling of Cache Associativity and Granularity

PROCEEDINGS OF THE INTERNATIONAL SYMPOSIUM ON MEMORY SYSTEMS (MEMSYS 2018), pp. 232–242.

co-author countries: United States of America 🇺🇸
author keywords: Partial Footprint; Mapped Footprint; Dual-grained Footprint; Joint Modeling
Sources: Web Of Science, ORCID
Added: July 22, 2019

2018 article

LEEM: Lean Elastic EM for Gaussian Mixture Model via Bounds-Based Filtering

2018 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), pp. 677–686.

By: S. Yang n & X. Shen n

co-author countries: United States of America 🇺🇸
author keywords: Gaussian Mixture Model; Acceleration; Expectation Maximization; Elastic EM
Sources: Web Of Science, ORCID
Added: May 6, 2019

2018 article

Rethinking Compilers in the Rise of Machine Learning and AI

CC'18: PROCEEDINGS OF THE 27TH INTERNATIONAL CONFERENCE ON COMPILER CONSTRUCTION, pp. 1–1.

By: X. Shen n

co-author countries: United States of America 🇺🇸
author keywords: Compilers; Machine Learning; AI; NLP; High-Level Program Optimizations
Sources: Web Of Science, ORCID
Added: February 25, 2019

2018 journal article

Walk entropy and walk-regularity

Linear Algebra and Its Applications, 546, 115–121.

co-author countries: United Kingdom of Great Britain and Northern Ireland 🇬🇧 United States of America 🇺🇸

Contributors: K. Kloster n, D. Král* & B. Sullivan n

author keywords: Graph entropy; Walk-regularity; Subgraph centrality; Matrix exponential
Source: ORCID
Added: February 8, 2019

2018 article

Exploring neighborhoods in large metagenome assembly graphs reveals hidden sequence diversity

Brown, C. T., Moritz, D., O’Brien, M. P., Reidl, F., Reiter, T., & Sullivan, B. D. (2018, November 5). BioRxiv, Vol. 11.

By: C. Brown, D. Moritz*, M. O’Brien*, F. Reidl*, T. Reiter & B. Sullivan*

co-author countries: United States of America 🇺🇸

Contributors: C. Brown, D. Moritz*, M. O’Brien*, F. Reidl*, T. Reiter & B. Sullivan*

Source: ORCID
Added: February 8, 2019

2018 article

FALCON: A Fast Drop-In Replacement of Citation KNN for Multiple Instance Learning

CIKM'18: PROCEEDINGS OF THE 27TH ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, pp. 67–76.

By: S. Yang n & X. Shen n

co-author countries: United States of America 🇺🇸
author keywords: Citation KNN; Triangle Inequality; Multiple-instance Learning
Sources: Web Of Science, ORCID
Added: February 4, 2019

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.