Computer Science

College of Engineering

Works Published in 2017

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 213 in total

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

2017 conference paper

Being even slightly shallow makes life hard

Leibniz International Proceedings in Informatics, LIPIcs, 83.

By: I. Muzi, M. O’Brien, F. Reidl & B. Sullivan

Source: ORCID
Added: August 6, 2022

2017 conference paper

A fast parameterized algorithm for Co-Path Set

Leibniz International Proceedings in Informatics, LIPIcs, 63.

By: B. Sullivan & A. Van Der Poel

Source: ORCID
Added: August 6, 2022

2017 conference paper

Asymptotic analysis of equivalences and core-structures in kronecker-style graph models

Proceedings - IEEE International Conference on Data Mining, ICDM, 829–834.

Source: ORCID
Added: August 6, 2022

2017 article

Optimizing Adiabatic Quantum Program Compilation using a Graph-Theoretic Framework

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

By: T. Goodrich, B. Sullivan & T. Humble

Source: ORCID
Added: August 6, 2022

2017 article

Being even slightly shallow makes life hard

ArXiv.

By: I. Muzi, M. O’Brien, F. Reidl & B. Sullivan

Source: ORCID
Added: August 6, 2022

2017 article

An experimental evaluation of a bounded expansion algorithmic pipeline

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

By: M. O’Brien & B. Sullivan

Source: ORCID
Added: August 6, 2022

2017 article

A practical fpt algorithm for flow decomposition and transcript assembly

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

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

Source: ORCID
Added: August 6, 2022

2017 article

Walk entropy and walk-regularity

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

By: K. Kloster, D. Král & B. Sullivan

Source: ORCID
Added: August 6, 2022

2017 conference paper

What does that ?-Block do? Learning latent causal affordances from mario play traces

AAAI Workshop - Technical Report, WS-17-01 - WS-17-15, 991–998. http://www.scopus.com/inward/record.url?eid=2-s2.0-85031928570&partnerID=MN8TOARS

By: A. Summeryille, M. Behrooz, M. Mateas & A. Jhala

Source: ORCID
Added: July 14, 2022

2017 conference paper

Modeling social interestingness in conversational stories

ACM International Conference Proceeding Series.

By: M. Behrooz & A. Jhala

Source: ORCID
Added: July 14, 2022

2017 conference paper

Prom week meets Skyrim

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, 3, 1790–1792. http://www.scopus.com/inward/record.url?eid=2-s2.0-85046476949&partnerID=MN8TOARS

By: M. Guimaraes, P. Santos & A. Jhala

Source: ORCID
Added: July 14, 2022

2017 conference paper

CiF-CK: An architecture for social NPCS in commercial games

2017 IEEE Conference on Computational Intelligence and Games, CIG 2017, 126–133.

By: M. Guimaraes, P. Santos & A. Jhala

Source: ORCID
Added: July 14, 2022

2017 conference paper

Prom week meets skyrim: Developing a social agent architecture in a commercial game

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, 3, 1562–1564. http://www.scopus.com/inward/record.url?eid=2-s2.0-85046418617&partnerID=MN8TOARS

By: M. Guimaraes, P. Santos & A. Jhala

Source: ORCID
Added: July 14, 2022

2017 journal article

An exploratory study of reliability of ranking vs. rating in peer assessment

International Journal of Educational and Pedagogical Sciences, 11(10).

By: Y. Song, Y. Guo & E. Gehringer

Sources: NC State University Libraries, ORCID
Added: July 12, 2022

2017 report

Two-stage Programming Projects: Individual Work Followed by Peer Collaboration

(Technical Report No. TR-2017-3). Raleigh, NC: North Carolina State University.

By: L. Battestilli & A. Awasthi

Source: NC State University Libraries
Added: May 27, 2022

2017 conference paper

The Value of Organized Study Groups in Large Classes

Battestilli, L., & Le, T. (2017, April 3). Presented at the NCSU Teaching and Learning Symposium, McKimmon Conference and Training Center, NC State University, Raleigh, NC.

By: L. Battestilli & T. Le

Event: NCSU Teaching and Learning Symposium at McKimmon Conference and Training Center, NC State University, Raleigh, NC on April 3, 2017

Source: NC State University Libraries
Added: May 27, 2022

2017 speech

Complexity Classes and NP-Completeness

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

2017 article

Automatically constructing training sets for electronic sentiment analysis

Devarajan, R., Benson, J. R., Caira, D. J., Sethi, S., Cox, J. A., Healey, C. G., … Padia, K. (2017, July). Google Patents.

By: R. Devarajan, J. Benson, D. Caira, S. Sethi, J. Cox, C. Healey, G. Dinakaran, K. Padia

Source: ORCID
Added: September 13, 2021

2017 journal article

3D face recognition in the Fourier domain using deformed circular curves

Multidimensional Systems and Signal Processing, 28(1), 105–127.

By: D. Lee & H. Krim

Source: Crossref
Added: December 31, 2020

2017 chapter

Efficient Outlier Detection in Hyperedge Streams Using MinHash and Locality-Sensitive Hashing

In C. Cherifi, H. Cherifi, M. Karsai, & M. Musolesi (Eds.), Complex Networks & Their Applications VI. COMPLEX NETWORKS 2017 (pp. 105–116).

By: S. Ranshous, M. Chaudhary & N. Samatova

Ed(s): C. Cherifi, H. Cherifi, M. Karsai & M. Musolesi

Source: Crossref
Added: December 11, 2020