Sciweavers

6040 search results - page 629 / 1208
» Generating Instance Models from Meta Models
Sort
View
DLOG
2008
15 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
DAM
2010
112views more  DAM 2010»
15 years 7 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
JAR
2000
145views more  JAR 2000»
15 years 7 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
ICML
2006
IEEE
16 years 8 months ago
Hierarchical classification: combining Bayes with SVM
We study hierarchical classification in the general case when an instance could belong to more than one class node in the underlying taxonomy. Experiments done in previous work sh...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
SSDBM
2003
IEEE
136views Database» more  SSDBM 2003»
16 years 13 days ago
Acceleration of Relational Index Structures Based on Statistics
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...