Works Published in 2018

search works

Displaying works 41 - 60 of 275 in total

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

2018 journal article

An efficient Lucas sequence-based batch auditing scheme for the Internet of medical things

IEEE Access, 7, 10077–10092.

By: J. Han, Y. Li, J. Liu & M. Zhao

Source: ORCID
Added: March 15, 2023

2018 conference paper

Adversarial examples against the deep learning based network intrusion detection systems

MILCOM 2018-2018 IEEE Military Communications Conference (MILCOM), 559–564.

By: K. Yang, J. Liu, C. Zhang & Y. Fang

Event: IEEE

Source: ORCID
Added: March 15, 2023

2018 conference paper

A privacy-preserving networked hospitality service with the bitcoin blockchain

international conference on wireless algorithms, systems, and applications, 696–708.

By: H. Zhou, Y. Niu, J. Liu, C. Zhang, L. Wei & Y. Fang

Event: Springer

Source: ORCID
Added: March 15, 2023

2018 journal article

A UHF RFID-based system for children tracking

IEEE Internet of Things Journal, 5(6), 5055–5064.

By: Y. Pang, H. Ding, J. Liu, Y. Fang & S. Chen

Source: ORCID
Added: March 15, 2023

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 conference paper

Preface

CEUR Workshop Proceedings, 2321. http://www.scopus.com/inward/record.url?eid=2-s2.0-85062210194&partnerID=MN8TOARS

By: H. Wu, M. Si & A. Jhala

Contributors: H. Wu, M. Si & A. Jhala

Source: ORCID
Added: July 14, 2022

2018 conference paper

MIDB: A web-based film annotation tool

CEUR Workshop Proceedings, 2321. http://www.scopus.com/inward/record.url?eid=2-s2.0-85062220146&partnerID=MN8TOARS

By: A. Althagafi, H. Wu & A. Jhala

Contributors: A. Althagafi, H. Wu & A. Jhala

Source: ORCID
Added: July 14, 2022

2018 conference paper

Abstractions for narrative comprehension tasks

CEUR Workshop Proceedings, 2321. http://www.scopus.com/inward/record.url?eid=2-s2.0-85062232028&partnerID=MN8TOARS

By: Y. Chen, J. Robertson & A. Jhala

Contributors: Y. Chen, J. Robertson & A. Jhala

Source: ORCID
Added: July 14, 2022

2018 conference paper

A joint attention model for automated editing

CEUR Workshop Proceedings, 2321. http://www.scopus.com/inward/record.url?eid=2-s2.0-85062242549&partnerID=MN8TOARS

By: H. Wu & A. Jhala

Contributors: H. Wu & A. Jhala

Source: ORCID
Added: July 14, 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 speech

An Introduction to Data Analysis

Presented at the PES University, Bangalore, India.

By: R. Yedida

Event: PES University at Bangalore, India

Source: NC State University Libraries
Added: January 13, 2022

2018 speech

Machine Learning

Presented at the PES University, Bangalore, India.

By: R. Yedida

Event: PES University at Bangalore, India

Source: NC State University Libraries
Added: January 13, 2022

2018 speech

How to design a Flappy Bird game

Presented at the PES University, Bangalore, India.

By: R. Yedida

Event: PES University at Bangalore, India

Source: NC State University Libraries
Added: January 13, 2022

2018 conference paper

Real time utility-based recommendation for revenue optimization via an adaptive online Top-K high utility itemsets mining model

ICNC-FSKD 2017 - 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, 1859–1866.

By: R. Yang n, M. Xu n, P. Jones n & N. Samatova*

Contributors: R. Yang n, M. Xu n, P. Jones n & N. Samatova*

TL;DR: This work considers that online transaction streams are usually accompanied with flow fluctuation, and proposes an Adaptive Online Top-K (RAOTK) high utility itemsets mining model to guide the utility-based recommendations. (via Semantic Scholar)
Source: ORCID
Added: December 6, 2021

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.