Sciweavers

3946 search results - page 423 / 790
» The computational complexity of choice sets
Sort
View
SEMWEB
2004
Springer
16 years 29 days ago
An Initial Investigation into Querying an Untrustworthy and Inconsistent Web
The Semantic Web is bound to be untrustworthy and inconsistent. In this paper, we present an initial approach for obtaining useful information in such an environment. In particular...
Yuanbo Guo, Jeff Heflin
MCMASTER
1993
15 years 11 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
ICCD
2000
IEEE
119views Hardware» more  ICCD 2000»
15 years 11 months ago
Source-Level Transformations for Improved Formal Verification
A major obstacle to widespread acceptance of formal verification is the difficulty in using the tools effectively. Although learning the basic syntax and operation of a formal ver...
Brian D. Winters, Alan J. Hu
ATMN
1993
15 years 9 months ago
Local Allocation of End-to-End Quality-of-Service in High-Speed Networks
Quality-of-service (QOS) requirements for applications in high-speed networks are typically specied on an end-to-end basis. Mapping this end-to-end requirement to nodal requiremen...
Ramesh Nagarajan, James F. Kurose, Donald F. Towsl...
BMCBI
2008
147views more  BMCBI 2008»
15 years 7 months ago
Simple integrative preprocessing preserves what is shared in data sources
Background: Bioinformatics data analysis toolbox needs general-purpose, fast and easily interpretable preprocessing tools that perform data integration during exploratory data ana...
Abhishek Tripathi, Arto Klami, Samuel Kaski