Sciweavers

162 search results - page 20 / 33
» Completeness Guarantees for Incomplete Reasoners
Sort
View
SIGMOD
2006
ACM
153views Database» more  SIGMOD 2006»
15 years 10 months ago
Interactive query formulation over web service-accessed sources
Integration systems typically support only a restricted set of queries over the schema they export. The reason is that the participating information sources contribute limited con...
Michalis Petropoulos, Alin Deutsch, Yannis Papakon...
IJSN
2006
65views more  IJSN 2006»
14 years 9 months ago
The loop fallacy and deterministic serialisation in tracing intrusion connections through stepping stones
: In order to conceal their identity and origin, network based intruders seldom attack directly from their own hosts, but rather stage their attacks through intermediate `stepping ...
Xinyuan Wang
SMA
1995
ACM
190views Solid Modeling» more  SMA 1995»
15 years 1 months ago
Creating solid models from single 2D sketches
We describe a method of constructing a B-rep solid model from a single hidden-line removed sketch view of a 3D object. The main steps of our approach are as follows. The sketch is...
Ian J. Grimstead, Ralph R. Martin
AAAI
2000
14 years 11 months ago
Redundancy in Random SAT Formulas
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
Yacine Boufkhad, Olivier Roussel
IEE
2008
115views more  IEE 2008»
14 years 10 months ago
Faithful mapping of model classes to mathematical structures
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
Ádám Darvas, Peter Müller