Sciweavers

1941 search results - page 78 / 389
» On the Hardness of Approximate Reasoning
Sort
View
GIS
1999
ACM
15 years 4 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas
SCAM
2006
IEEE
15 years 5 months ago
Characterising, Explaining, and Exploiting the Approximate Nature of Static Analysis through Animation
This paper addresses the question: “How can animated visualisation be used to express interesting properties of static analysis?” The particular focus is upon static dependenc...
David Binkley, Mark Harman, Jens Krinke
JNS
2010
61views more  JNS 2010»
14 years 10 months ago
Validity and Failure of the Boltzmann Approximation of Kinetic Annihilation
This paper introduces a new method to show the validity of a continuum description for the deterministic dynamics of many interacting particles. Here the many particle evolution is...
Karsten Matthies, Florian Theil
LPNMR
2005
Springer
15 years 5 months ago
Approximating Answer Sets of Unitary Lifschitz-Woo Programs
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
Victor W. Marek, Inna Pivkina, Miroslaw Truszczyns...
JMLR
2006
107views more  JMLR 2006»
14 years 12 months ago
Bounds for the Loss in Probability of Correct Classification Under Model Based Approximation
In many pattern recognition/classification problem the true class conditional model and class probabilities are approximated for reasons of reducing complexity and/or of statistic...
Magnus Ekdahl, Timo Koski