Sciweavers

1941 search results - page 266 / 389
» On the Hardness of Approximate Reasoning
Sort
View
ECAI
2004
Springer
15 years 10 months ago
Lakatos-Style Automated Theorem Modification
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
Simon Colton, Alison Pease
CCS
2008
ACM
15 years 8 months ago
Minimal backups of cryptographic protocol runs
As cryptographic protocols execute they accumulate information such as values and keys, and evidence of properties about this information. As execution proceeds, new information b...
Jay A. McCarthy, Shriram Krishnamurthi
VIIP
2001
15 years 7 months ago
3-D Haar Wavelet Transformation and Texture-based 3-D Reconstruction of Biomedical Data Sets
Enhanced biomedical image scanning technology and growing network accessibility have created a need for faster and more efficient data exchange over the Internet and in closed net...
Pujita Pinnamaneni, Sagar Saladi, Joerg Meyer
DLOG
1998
15 years 7 months ago
Comparing Subsumption Optimizations
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...
Ian Horrocks, Peter F. Patel-Schneider
GIS
2008
ACM
15 years 7 months ago
Heuristic algorithms for route-search queries over geographical data
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...
Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv, Yerach...