Works Published in 2018

search works

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

TL;DR: The Flow Decomposition problem, which asks for the smallest set of weighted paths that "covers" a flow on a DAG, has recently been used as an important computational step in transcript assembly and it is proved the problem is in FPT when parameterized by the number of paths by giving a practical linear fpt algorithm. (via Semantic Scholar)
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).

TL;DR: This work develops a new baseline for embedding a wide range of optimization problems into fault-free D-Wave annealing hardware, and introduces a graph-theoretic framework for developing structured embedding algorithms. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries, 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

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

TL;DR: Low-treedepth colorings are introduced as an alternative to the commonly used p-centered colorings and a co-NP-completeness reduction is given for recognizing p-linear colorings, and polynomial upper bounds are established via constructive coloring algorithms in trees and intervals graphs and it is conjecture that aPolynomial relationship is in fact the worst case in general graphs. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries, 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.

Event: the 2018 International Conference

author keywords: Compilers; Domain Specific Languages; Text Analytics
TL;DR: Zwift is presented, the first programming framework for TADOC, which consists of a Domain Specific Language, a compiler and runtime, and a utility library, and experiments show that Zwift significantly improves programming productivity, while effectively unleashing the power of TAD OC. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
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*

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

TL;DR: This project investigates a series of designs to improve pipeline flexibility and adaptivity, while also increasing performance, and shows that with the new flexible communication schemes, the CPU time spent during training is reduced by 2-11X, and the implementation can achieve up to 10X speedups when CPU core limits are imposed. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: January 25, 2020

2018 journal article

Resolving the GPU responsiveness dilemma through program transformations

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

author keywords: program transformation; GPU; integrated architecture; responsiveness
TL;DR: This study identifies the GPU responsiveness dilemma: host busy polling responds quickly, but at the expense of high energy consumption and interference with co-running CPU programs; interrupt-based notification minimizes energy and CPU interference costs, but suffers from substantial response delay. (via Semantic Scholar)
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy (OpenAlex)
Sources: Crossref, NC State University Libraries
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

TL;DR: A set of novel techniques are presented, including reuse-based filtering, center reuse, and a two-phase design to capitalize on the reuse opportunities on three levels: validation, k, and feature sets, to accelerate k-means configuration. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
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.

author keywords: Partial Footprint; Mapped Footprint; Dual-grained Footprint; Joint Modeling
TL;DR: This short paper shows how the new models are more general, accurate or efficient than previous modeling solutions in either technique, and how they can be used together to model the cache implemented with both techniques, i.e. sub-block set associative cache. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
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

author keywords: Gaussian Mixture Model; Acceleration; Expectation Maximization; Elastic EM
TL;DR: This work proposes several novel optimizations to further accelerate Elastic EM, which brings multi-fold speedups on six datasets of various sizes and dimensions and creates Lean Elastic EM (LEEM), which is named Elastic EM in this paper. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
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

author keywords: Compilers; Machine Learning; AI; NLP; High-Level Program Optimizations
TL;DR: This talk will discuss how ML and AI may help break the "abstraction wall"---barriers formed by layers of abstractions in modern software---for program analysis and optimizations, and how ML may transform the way in which high-level user intentions get translated into low-level code implementations. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: February 25, 2019

2018 journal article

Walk entropy and walk-regularity

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

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*

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

TL;DR: An information retrieval system for large metagenomic data sets that exploits the sparsity of DNA assembly graphs to efficiently extract subgraphs surround-ing an inferred genome is introduced. (via Semantic Scholar)
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

author keywords: Citation KNN; Triangle Inequality; Multiple-instance Learning
TL;DR: FALCON accelerates Citation KNN by removing unnecessary distance calculations through two novel optimizations, multi-level triangle inequality-based distance filtering and heap optimization, making it a promising drop-in replacement of Citation Knn for multiple instance learning. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
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.