Works Published in 2017
Displaying works 41 - 60 of 258 in total
Sorted by most recent date added to the index first, which may not be the same as publication date order.
2017 journal article
Publicly verifiable boolean query over outsourced encrypted data
IEEE Transactions on Cloud Computing, 7(3), 799–813.
Source: ORCID
Added: March 15, 2023
2017 conference paper
Communication through symbol silence: Towards free control messages in indoor wlans
2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS), 880–888.
Event: IEEE
Source: ORCID
Added: March 15, 2023
2017 conference paper
An anonymous and accountable authentication scheme for Wi-Fi hotspot access with the Bitcoin blockchain
2017 IEEE/CIC International Conference on Communications in China (ICCC), 1–6.
Event: IEEE
Source: ORCID
Added: March 15, 2023
2017 conference paper
Being even slightly shallow makes life hard
Leibniz International Proceedings in Informatics, LIPIcs, 83.
Contributors: I. Muzi *, . M.P. O'Brien, F. Reidl * & B. Sullivan n
TL;DR:
Dense $r/2$-Shallow Topological Minor and Dense £r-Subdivsion are already NP-hard for r = 1$ in very sparse graphs and do not admit algorithms with running time $2^{o(\mathbf{tw}^2)} n^{O(1)}$ when parameterized by the treewidth of the input graph for $r \geq 2$ unless ETH fails.
(via Semantic Scholar)
Source: ORCID
Added: August 6, 2022
2017 conference paper
A fast parameterized algorithm for Co-Path Set
Leibniz International Proceedings in Informatics, LIPIcs, 63.
Contributors: B. Sullivan n & A. Van Der Poel n
TL;DR:
A linear-time fpt algorithm with complexity O^*(1.588^k) for deciding k-CO-PATH SET is given, significantly improving the previously best known O*(2.17^ k) of Feng, Zhou, and Wang (2015).
(via Semantic Scholar)
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.
Contributors: A. Chin, T. Goodrich, . M.P. O'Brien, F. Reidl, B. Sullivan & A. Van Der Poel
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
Contributors: T. Goodrich, B. Sullivan & T. Humble
Source: ORCID
Added: August 6, 2022
2017 article
Being even slightly shallow makes life hard
ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85094429786&partnerID=MN8TOARS
Contributors: I. Muzi, . M.P. 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
Contributors: . M.P. 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
Contributors: K. Kloster, P. Kuinke, . M.P. 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
Contributors: 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
Contributors: 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.
Contributors: M. Behrooz* & A. Jhala n
TL;DR:
The results from classification and regression tasks look promising overall, indicating that general metrics of social interestingness of stories could be modeled for sociable agents.
(via Semantic Scholar)
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
Contributors: 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.
Contributors: M. Guimaraes *, P. Santos * & A. Jhala n
TL;DR:
The key contribution of this work is in adapting the richness of social interactions from CiF to a first-person interaction experience and a released distribution of its implementation on the Skyrim game engine.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
10. Reduced Inequalities
(OpenAlex)
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
Contributors: 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).
Sources: NC State University Libraries, NC State University Libraries
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.
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.
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.
Event: PES University at Bangalore, India
Source: NC State University Libraries
Added: January 13, 2022
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.
