Sciweavers

229 search results - page 24 / 46
» How Efficient Can Memory Checking Be
Sort
View
AAAI
1993
13 years 9 months ago
Supporting and Optimizing Full Unification in a Forward Chaining Rule System
The Rete and Treat algorithms are considered the most efficient implementation techniques for Forward Chaining rule systems. These algorithms support a language of limited express...
Howard E. Shrobe
HPDC
2010
IEEE
13 years 8 months ago
Mendel: efficiently verifying the lineage of data modified in multiple trust domains
Data is routinely created, disseminated, and processed in distributed systems that span multiple administrative domains. To maintain accountability while the data is transformed b...
Ashish Gehani, Minyoung Kim
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 7 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
TISSEC
2002
82views more  TISSEC 2002»
13 years 7 months ago
Trust management for IPsec
IPsec is the standard suite of protocols for networklayer confidentiality and authentication of Internet traffic. The IPsec protocols, however, do not address the policies for how...
Matt Blaze, John Ioannidis, Angelos D. Keromytis
IPAW
2010
13 years 5 months ago
Provenance of Decisions in Emergency Response Environments
Mitigating the devastating ramifications of major disasters requires emergency workers to respond in a maximally efficient way. Information systems can improve their efficiency by ...
Iman Naja, Luc Moreau, Alex Rogers