Sciweavers

1382 search results - page 260 / 277
» Procedural Generation of Roads
Sort
View
ESOP
2000
Springer
13 years 11 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
KDD
2000
ACM
133views Data Mining» more  KDD 2000»
13 years 11 months ago
Data selection for support vector machine classifiers
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
Glenn Fung, Olvi L. Mangasarian
ICDT
2010
ACM
161views Database» more  ICDT 2010»
13 years 10 months ago
Data Correspondence, Exchange, and Repair
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
Gösta Grahne, Adrian Onet
ICDT
2010
ACM
193views Database» more  ICDT 2010»
13 years 9 months ago
Data correspondence, exchange and repair
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
Gösta Grahne, Adrian Onet
DLOG
2008
13 years 9 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer