Works Published in 2003
Displaying works 21 - 40 of 122 in total
Sorted by most recent date added to the index first, which may not be the same as publication date order.
2003 chapter
Absolute factorization of polynomials
In J. Grabmeier, E. Kaltofen, & V. Weispfenning (Eds.), Computer Algebra Handbook (p. 26). Heidelberg, Germany: Springer Verlag.
Ed(s): J. Grabmeier, E. Kaltofen & V. Weispfenning
Source: NC State University Libraries
Added: December 5, 2020
2003 chapter
Computer algebra - impact on research
In J. Grabmeier, E. Kaltofen, & V. Weispfenning (Eds.), Computer Algebra Handbook (pp. 4–6). Heidelberg, Germany: Springer Verlag.
Ed(s): J. Grabmeier, E. Kaltofen & V. Weispfenning
Source: NC State University Libraries
Added: December 5, 2020
2003 book
Trust, Reputation, and Security: Theories and Practice
Ed(s): R. Falcone, S. Barber, L. Korba & M. Singh*
TL;DR:
This paper attempts to challenge researchers in the community toward future work concerning three issues inspired by the workshop's roundtable discussion: distinguishing elements of an agent’s behavior that influence its trustworthiness, building reputation-based trust models without relying on interaction, and benchmarking trust modeling algorithms.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: November 15, 2020
2003 journal article
An introduction to optical burst switching
IEEE Communications Magazine, 41(8), S10–S15.
TL;DR:
This article summarizes in a systematic way the main OBS design parameters and the solutions that have been proposed in the open literature and shows how the framework achieves high traffic throughput and high resource utilization.
(via Semantic Scholar)
semanticscholar.org (repository)
Sources: Crossref, NC State University Libraries
Added: September 13, 2020
2003 conference paper
Polynomial factorization
Proceedings of the 2003 international symposium on Symbolic and algebraic computation - ISSAC '03. Presented at the the 2003 international symposium.
Event: the 2003 international symposium
TL;DR:
The baby steps/giant steps technique and fast distinct and equaldegree factorization implementations have, at last, yielded in themid 1990s theoretical and practical improvements over the originalunivariate Berlekamp algorithm for coefficients in finite fields.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
2003 conference paper
On approximate irreducibility of polynomials in several variables
Proceedings of the 2003 international symposium on Symbolic and algebraic computation - ISSAC '03. Presented at the the 2003 international symposium.
Event: the 2003 international symposium
TL;DR:
Using an absolute irreducibility criterion due to Ruppert, this work is able to find useful separation bounds, in several norms, for bivariate polynomials, and derive new, more effective Noether forms for polynmials of arbitrarily many variables.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
2003 conference paper
Ρ-Queries:: enabling querying for semantic associations on the semantic web
Proceedings of the twelfth international conference on World Wide Web - WWW '03.
TL;DR:
This paper presents the notion of Semantic Associations as complex relationships between resource entities based on a specific notion of similarity called r-isomorphism, and formalizes these notions for the RDF data model, by introducing a notion of a Property Sequence as a type.
(via Semantic Scholar)
Source: ORCID
Added: May 1, 2020
2003 conference paper
Modeling hinting strategies for geometry theorem proving
Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), 2702, 373–377. http://www.scopus.com/inward/record.url?eid=2-s2.0-8344255630&partnerID=MN8TOARS
Contributors: N. Matsuda & K. VanLehn
Source: ORCID
Added: February 11, 2020
2003 journal article
TL;DR:
The author proposes a conceptual shift from individual agent representations to social interaction and looks at the underlying reasons why agents from different vendors-or even different research projects-cannot communicate with each other.
(via Semantic Scholar)
Source: ORCID
Added: December 10, 2019
2003 journal article
Trustworthy service caching: Cooperative search in P2P information systems
Lecture Notes in Computer Science, 3030, 32–44.
Contributors: M. Singh n , Y. Udupi n & P. Yolum *
TL;DR:
The main results are that, even with a small cache, agents can locate services more easily and benefit from being neighbours with others who have similar interests, and since the agents that cache services can act like service providers, a small number of initial service providers are enough to serve the information needs of the consumers.
(via Semantic Scholar)
Sources: ORCID, NC State University Libraries
Added: December 10, 2019
2003 book
Trustworthy service composition: Challenges and research questions
In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2631, pp. 39–52). http://www.scopus.com/inward/record.url?eid=2-s2.0-7044270651&partnerID=MN8TOARS
Contributors: M. Singh
Source: ORCID
Added: December 10, 2019
2003 conference paper
The future of agent communication
Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), 2650, 318–322. http://www.scopus.com/inward/record.url?eid=2-s2.0-23144467458&partnerID=MN8TOARS
Contributors: M. Singh
Source: ORCID
Added: December 10, 2019
2003 conference paper
Searching Social Networks
Proceedings of the Interantional Conference on Autonomous Agents, 2, 65–72. http://www.scopus.com/inward/record.url?eid=2-s2.0-1142305174&partnerID=MN8TOARS
Contributors: B. Yu & M. Singh
Source: ORCID
Added: December 10, 2019
2003 book
Preface
In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2631). http://www.scopus.com/inward/record.url?eid=2-s2.0-84945527959&partnerID=MN8TOARS
Contributors: R. Falcone, S. Barber, L. Korba & M. Singh
Source: ORCID
Added: December 10, 2019
2003 conference paper
Peer-to-peer computing for information systems
Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), 2530, 15–20. http://www.scopus.com/inward/record.url?eid=2-s2.0-23144433600&partnerID=MN8TOARS
Contributors: M. Singh
Source: ORCID
Added: December 10, 2019
2003 conference paper
Engineering Commitment-Based Multiagent Systems: A Temporal Logic Approach
Proceedings of the International Conference on Autonomous Agents, 2, 891–898. http://www.scopus.com/inward/record.url?eid=2-s2.0-1142292521&partnerID=MN8TOARS
Contributors: J. Xing & M. Singh
Source: ORCID
Added: December 10, 2019
2003 conference paper
Emergent Properties of Referral Systems
Proceedings of the Interantional Conference on Autonomous Agents, 2, 592–599. http://www.scopus.com/inward/record.url?eid=2-s2.0-1142293029&partnerID=MN8TOARS
Contributors: P. Yolum & M. Singh
Source: ORCID
Added: December 10, 2019
2003 journal article
Dynamic communities in referral networks
Web Intelligence and Agent Systems, 1(2), 105–116. http://www.scopus.com/inward/record.url?eid=2-s2.0-2942625505&partnerID=MN8TOARS
Contributors: P. Yolum & M. Singh
Source: ORCID
Added: December 10, 2019
2003 conference paper
Distributed Enactment of Multiagent Workflows: Temporal Logic for Web Service Composition
Proceedings of the Interantional Conference on Autonomous Agents, 2, 907–914. http://www.scopus.com/inward/record.url?eid=2-s2.0-1142268242&partnerID=MN8TOARS
Contributors: M. Singh
Source: ORCID
Added: December 10, 2019
2003 conference paper
Detecting Deception in Reputation Management
Proceedings of the Interantional Conference on Autonomous Agents, 2, 73–80. http://www.scopus.com/inward/record.url?eid=2-s2.0-1142293052&partnerID=MN8TOARS
Contributors: B. Yu & M. Singh
Source: ORCID
Added: December 10, 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.
