Works Published in 2014
Displaying works 101 - 120 of 221 in total
Sorted by most recent date added to the index first, which may not be the same as publication date order.
2014 conference paper
Message from the program chairs
ACM International Conference Proceeding Series. http://www.scopus.com/inward/record.url?eid=2-s2.0-84906819223&partnerID=MN8TOARS
Contributors: D. Nicol & M. Singh
Source: ORCID
Added: December 10, 2019
2014 conference paper
ReNew: A semi-supervised framework for generating domain-specific lexicons and sentiment analysis
52nd Annual Meeting of the Association for Computational Linguistics, ACL 2014 - Proceedings of the Conference, 1, 542–551. http://www.scopus.com/inward/record.url?eid=2-s2.0-84906923074&partnerID=MN8TOARS
Contributors: Z. Zhang & M. Singh
Source: ORCID
Added: December 10, 2019
2014 conference paper
Exploiting sentiment homophily for link prediction
RecSys 2014 - Proceedings of the 8th ACM Conference on Recommender Systems, 17–24.
Contributors: G. Yuan n, P. Murukannaiah n, Z. Zhang n & M. Singh n
author keywords: Social media; Social networks; Link prediction; Sentiment analysis; Topic affiliation
TL;DR:
This work defines a set of sentiment-based features that help predict the likelihood of two users becoming "friends" based on their sentiments toward topics of mutual interest and proposes a factor graph model that incorporates a sentiment- based variant of cognitive balance theory.
(via Semantic Scholar)
Source: ORCID
Added: December 10, 2019
2014 journal article
Determining Team Hierarchy from Broadcast Communications
Lecture Notes in Computer Science.
Contributors: R. Govindan *, D. Ungvarsky*, N. Buchler*, A. Kalia n & M. Singh n
TL;DR:
A novel approach that takes as input broadcast messages, extracts communication patterns—as well as semantic, communication, and social features—and outputs an organizational hierarchy is contributed.
(via Semantic Scholar)
Source: ORCID
Added: December 10, 2019
2014 book
Estimating trust from agents' interactions via commitments
In Frontiers in Artificial Intelligence and Applications (Vol. 263, pp. 1043–1044).
Contributors: A. Kalia n, Z. Zhang n & M. Singh n
TL;DR:
A probabilistic model for trust based on commitment outcomes is proposed and it is shown how to train its parameters for each subject based on the subject's trust assessments, which are promising, though imperfect.
(via Semantic Scholar)
Source: ORCID
Added: December 10, 2019
2014 book
Determining team hierarchy from broadcast communications
In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8851, pp. 493–507). http://www.scopus.com/inward/record.url?eid=2-s2.0-84914173058&partnerID=MN8TOARS
Contributors: A. Kalia, N. Buchler, D. Ungvarsky, R. Govindan & M. Singh
Source: ORCID
Added: December 10, 2019
2014 conference paper
Extracting normative relationships from business contracts
13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014, 1, 101–108. http://www.scopus.com/inward/record.url?eid=2-s2.0-84911401191&partnerID=MN8TOARS
Contributors: X. Gao & M. Singh
Source: ORCID
Added: December 10, 2019
2014 conference paper
Characterizing artificial socio-cognitive technical systems
CEUR Workshop Proceedings, 1283, 336–346. http://www.scopus.com/inward/record.url?eid=2-s2.0-84910069753&partnerID=MN8TOARS
Contributors: R. Christiaanse, A. Ghose, P. Noriega & M. Singh
Source: ORCID
Added: December 10, 2019
2014 journal article
Argument schemes for reasoning about trust
Argument and Computation, 5(2-3), 160–190.
Contributors: S. Parsons *, K. Atkinson *, Z. Li*, P. McBurney*, E. Sklar *, M. Singh n , K. Haigh *, K. Levitt *, J. Rowe*
author keywords: argument representation; formal models of argumentation; social influence
content.iospress.com (publisher PDF)
Source: ORCID
Added: December 10, 2019
2014 conference paper
Including blind people in computing through access to graphs
Proceedings of the 16th international ACM SIGACCESS conference on Computers & accessibility, 91–98.
Event: ACM
Source: ORCID
Added: December 6, 2019
2014 conference paper
A Model of Trust, Moods, and Emotions in Multiagent Systems, and its Empirical Evaluation
Proceedings of the 16th AAMAS Workshop on Trust in Agent Societies (Trust), 1740, 1–11. http://www.scopus.com/inward/record.url?eid=2-s2.0-85006168135&partnerID=MN8TOARS
Event: International Joint Conference on Autonomous Agents and Multiagent Systems at Paris, France
Sources: NC State University Libraries, ORCID
Added: September 29, 2019
2014 chapter
Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations
In Computer Mathematics (pp. 183–197).
TL;DR:
By way of experiments, the techniques can recover approximate sparse shifted polynomial models, provided that there are few terms \(t\), few outliers and that the sparse shift is relatively small.
(via Semantic Scholar)
Source: Crossref
Added: July 27, 2019
2014 chapter
Symbolic Computation and Complexity Theory Transcript of My Talk
In Computer Mathematics (pp. 3–7).
TL;DR:
I gave talks at the conference Alan Turing’s Heritage: Logic, Computation & Complexity in Lyon, France, and at the Tenth Asian Symposium on Computer Mathematics (ASCM) in Beijing, China, on the complexity theoretic hardness of many problems that the discipline of symbolic computation tackles.
(via Semantic Scholar)
Source: Crossref
Added: July 27, 2019
2014 conference paper
Cleaning-up data for sparse model synthesis
Proceedings of the 2014 Symposium on Symbolic-Numeric Computation - SNC '14. Presented at the the 2014 Symposium.
Event: the 2014 Symposium
TL;DR:
The pioneering creation of interpolation algorithms that can account for sparsity in the resulting multi-dimensional models are created, for example, by Zippel, Ben-Or and Tiwari and Kaltofen-Yang-Zhi.
(via Semantic Scholar)
Source: Crossref
Added: July 21, 2019
2014 conference paper
Numerical linear system solving with parametric entries by error correction
Proceedings of the 2014 Symposium on Symbolic-Numeric Computation - SNC '14. Presented at the the 2014 Symposium.
Event: the 2014 Symposium
TL;DR:
The algorithm generalizes Welch/Berlekamp decoding of Reed/Solomon error correcting codes and their numeric floating point counterparts and gives an algorithm that computes the unique solution, which is a vector of rational functions, by evaluating the parameter u at distinct points.
(via Semantic Scholar)
Source: Crossref
Added: July 21, 2019
2014 conference paper
Essentially optimal interactive certificates in linear algebra
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation - ISSAC '14. Presented at the the 39th International Symposium.
Event: the 39th International Symposium
TL;DR:
All the authors' certificates are based on interactive verification protocols with the interaction removed by a Fiat-Shamir identification heuristic, and the validity of the verification procedure is subject to standard computational hardness assumptions from cryptography.
(via Semantic Scholar)
Source: Crossref
Added: July 21, 2019
2014 conference paper
Sparse polynomial interpolation codes and their decoding beyond half the minimum distance
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation - ISSAC '14. Presented at the the 39th International Symposium.
Event: the 39th International Symposium
TL;DR:
A new polynomial-time list decoding algorithm uses sub-sequences of the received evaluations indexed by an arithmetic progression, allowing the decoding for a larger radius, that is, more errors in the evaluations while returning a list of candidate sparse polynomials.
(via Semantic Scholar)
Source: Crossref
Added: July 21, 2019
2014 conference paper
Sparse multivariate function recovery with a high error rate in the evaluations
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation - ISSAC '14. Presented at the the 39th International Symposium.
Event: the 39th International Symposium
TL;DR:
A different algorithm is presented that can interpolate a sparse multivariate rational function from evaluations where the error rate is 1/q for any q > 2, which the ISSAC 2013 algorithm could not handle.
(via Semantic Scholar)
Source: Crossref
Added: July 21, 2019
2014 conference paper
A survey of methods for improving review quality
Proceedings of the 13th International Conference on Web-Based Learning: Peer-Review, Peer-Assessment, and Self-Assessment in Education. Presented at the The 13th International Conference on Web-Based Learning: Peer-Review, Peer-Assessment, and Self-Assessment in Education, Talinn, Estonia.
Event: The 13th International Conference on Web-Based Learning: Peer-Review, Peer-Assessment, and Self-Assessment in Education at Talinn, Estonia on August 14-17, 2014
Sources: NC State University Libraries, ORCID
Added: June 8, 2019
2014 conference paper
Optimizing your teaching load
2014 ASEE Annual Conference & Exposition. Presented at the 2014 ASEE Annual Conference & Exposition, Indianapolis, Indiana.
Event: 2014 ASEE Annual Conference & Exposition at Indianapolis, Indiana on June 15-18, 2014
Sources: NC State University Libraries, NC State University Libraries, ORCID
Added: April 21, 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.
