Works Published in 2015
Displaying all 18 works
Sorted by most recent date added to the index first, which may not be the same as publication date order.
2015 journal article
Zig-Zag Numberlink is NP-Complete
Journal of Information Processing, 23(3), 239–245.
Contributors: A. Adcock*, E. Demaine *, M. Demaine*, . M.P. O'Brien, F. Reidl *, F. Villaamil*, B. Sullivan n
TL;DR:
The hardness result can be compared to two previous NP-hardness proofs: Lynch's 1975 proof without the ``cover all vertices'' constraint, and Kotsuma and Takenaga's 2010 proof when the paths are restricted to have the fewest possible corners within their homotopy class.
(via Semantic Scholar)
www.jstage.jst.go.jp (publisher PDF)
Source: ORCID
Added: August 6, 2022
2015 report
Yinyang K-Means: A Drop-In Replacement of the Classic K-Means with Consistent Speedup
(Technical Report No. TR-2015-2). North Carolina State University.
Source: NC State University Libraries
Added: January 30, 2021
2015 report
TOP: A Framework for Enabling Algorithmic Optimizations for Distance-Related Problems”
(Technical Report No. TR-2015-3). North Carolina State University.
Source: NC State University Libraries
Added: January 30, 2021
2015 conference paper
TOP: A Framework for Enabling Algorithmic Optimizations for Distance-Related Problems
In C. Li & V. Markl (Eds.), 41st International Conference on Very Large Data Bases (VLDB 2015) : proceedings of the VLDB Endowment, volume 8, number 1-13, Kohala Coast, Hawaii, USA, 31 August-4 September 2015. Stanford, CA: VLDB Endowment.
Ed(s): C. Li & V. Markl
Event: 41st International Conference on Very Large Data Bases at Kohala Coast, Hawaii
Source: NC State University Libraries
Added: January 30, 2021
2015 conference paper
Yinyang K-Means: A Drop-In Replacement of the Classic K-Means with Consistent Speedup
Proceedings of the 32nd International Conference on Machine Learning, 37, 579–587. Lille, France.
Event: The 32nd International Conference on Machine Learning at Lille, France on July 6-11, 2015
Source: NC State University Libraries
Added: January 30, 2021
2015 conference paper
Enabling and Exploiting Flexible Task Assignment on GPU through SM-Centric Program Transformations
Proceedings of the 29th ACM on International Conference on Supercomputing - ICS '15. Presented at the the 29th ACM.
Event: the 29th ACM
author keywords: GPGPU; Scheduling; Compiler Transformation; Data Affinity; Program Co-Run
TL;DR:
It is shown that some simple optimization techniques can enhance co-runs of multiple kernels and improve data locality of irregular applications, producing 20-33% average increase in performance, system throughput, and average turnaround time.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
8. Decent Work and Economic Growth
(OpenAlex)
Sources: Crossref, ORCID
Added: September 5, 2020
2015 conference paper
Free launch
Proceedings of the 48th International Symposium on Microarchitecture - MICRO-48. Presented at the the 48th International Symposium.
Event: the 48th International Symposium
author keywords: GPU; Dynamic Parallelism; Optimization; Thread Reuse Compiler; Runtime Adaptation
TL;DR:
This work proposes free launch, a new software approach to overcoming the shortcomings of both methods for exploiting dynamic parallelism on GPU, which employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads.
(via Semantic Scholar)
Sources: Crossref, ORCID
Added: September 5, 2020
2015 chapter
Understanding Co-run Degradations on Integrated Heterogeneous Processors
In Languages and Compilers for Parallel Computing (pp. 82–97).
author keywords: Heterogeneous architecture; Performance analysis; CPU and memory contention; Optimization; GPGPU
TL;DR:
Co-runs of independent applications on systems with heterogeneous processors are common and limited understanding on the influence of co-runners on such systems is limited.
(via Semantic Scholar)
Source: Crossref
Added: September 4, 2020
2015 article
Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs
ALGORITHMS AND MODELS FOR THE WEB GRAPH, (WAW 2015), Vol. 9479, pp. 29–41.
Contributors: M. Farrell *, T. Goodrich n, N. Lemons*, F. Reidl *, F. Villaamil* & B. Sullivan n
Sources: Web Of Science, NC State University Libraries, ORCID
Added: August 6, 2018
2015 article
On the Threshold of Intractability
ALGORITHMS - ESA 2015, Vol. 9294, pp. 411–423.
Contributors: P. Drange *, M. Dregi*, D. Lokshtanov* & B. Sullivan n
TL;DR:
This article shows that both graph modification problems are Open image in new window -hard, resolving a conjecture by Natanzon, Shamir, and Sharan (2001), and gives a subexponential time parameterized algorithm solving this problem.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: Web Of Science, NC State University Libraries, ORCID
Added: August 6, 2018
2015 article
On-the-Fly Principled Speculation for FSM Parallelization
Zhao, Z., & Shen, X. (2015, April). ACM SIGPLAN NOTICES, Vol. 50, pp. 619–630.
author keywords: Languages; Performance; Finite State Machine; FSM; DFA; Speculative Parallelization; Multicore; Online Profiling
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2015 article
Multi-Level Anomaly Detection on Time-Varying Graph Data
PROCEEDINGS OF THE 2015 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2015), pp. 579–583.
Contributors: R. Bridges *, J. Collins *, E. Ferragut*, J. Laska* & B. Sullivan n
TL;DR:
This work introduces a generalization of the BTER model of Seshadhri et al. by adding flexibility to community structure, and uses this model to perform multi-scale graph anomaly detection, accurately detecting anomalies at the node, subgraph, and graph levels.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, ORCID
Added: August 6, 2018
2015 journal article
Statistical methods for combining information: Stryker family of vehicles reliability case study
Journal of Quality Technology, 47(4), 400–415.
Contributors: R. Dickinson*, L. Freeman *, B. Simpson* & A. Wilson n
TL;DR:
It is shown that, when the available information across two test phases for the Stryker family of vehicles is combined, reliability estimates are more accurate and precise than those reported previously using traditional methods that use only operational test data in their reliability assessments.
(via Semantic Scholar)
Sources: NC State University Libraries, ORCID
Added: August 6, 2018
2015 article
Computing quality scores and uncertainty for approximate pattern matching in geospatial semantic graphs
STATISTICAL ANALYSIS AND DATA MINING, Vol. 8, pp. 340–352.
Contributors: D. Stracuzzi*, R. Brost*, C. Phillips *, D. Robinson*, A. Wilson n & D. Woodbridge*
author keywords: uncertainty; confidence intervals; statistical models; graphical models; distance metric; image interpretation; graph search
TL;DR:
This work considers the problem of calculating a quality score for each match to the query, given that the underlying data are uncertain and presents a preliminary evaluation of three methods for determining both match quality scores and associated uncertainty bounds.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
3. Good Health and Well-being
(Web of Science)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2015 journal article
WHY DO SIMPLE ALGORITHMS FOR TRIANGLE ENUMERATION WORK IN THE REAL WORLD?
INTERNET MATHEMATICS, 11(6), 555–571.
Contributors: J. Berry*, L. Fostvedt *, D. Nordman*, C. Phillips *, C. Seshadhri * & A. Wilson n
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018
2015 journal article
Enabling Portable Optimizations of Data Placement on GPU
IEEE Micro, 35(4), 16–24.
TL;DR:
Porple offers a solution that, for the first time, makes it possible to automatically enhance data placement across a GPU, and shows that Porple consistently finds optimal or near-optimal placement, yielding up to 2.93 times speedups compared to programmers' decisions.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018
2015 article
Autotuning Algorithmic Choice for Input Sensitivity
Ding, Y., Ansel, J., Veeramachaneni, K., Shen, X., O'Reilly, U.-M., & Amarasinghe, S. (2015, June). ACM SIGPLAN NOTICES, Vol. 50, pp. 379–390.
author keywords: Algorithms; Languages; Performance; Petabricks; Autotuning; Algorithmic Optimization; Input Adaptive; Input Sensitivity; Two-level Input Learning
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2015 conference paper
Understanding co-run degradations on integrated heterogeneous processors
Languages and compilers for parallel computing (lcpc 2014), 8967, 82–97.
Source: NC State University Libraries
Added: August 6, 2018
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.
