Sciweavers

117 search results - page 9 / 24
» Open Constraints in a Closed World
Sort
View
CIKM
2010
Springer
13 years 5 months ago
Automatic schema merging using mapping constraints among incomplete sources
Schema merging is the process of consolidating multiple schemas into a unified view. The task becomes particularly challenging when the schemas are highly heterogeneous and autono...
Xiang Li 0002, Christoph Quix, David Kensche, Sand...
ICDE
2007
IEEE
114views Database» more  ICDE 2007»
14 years 8 months ago
Reverse Query Processing
Traditionally, query processing gets a query and a database instance as input and returns the result of the query for that particular database instance. Reverse query processing (...
Carsten Binnig, Donald Kossmann, Eric Lo
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 8 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
IJCV
2006
94views more  IJCV 2006»
13 years 7 months ago
Four Points in Two or Three Calibrated Views: Theory and Practice
Suppose two perspective views of four world points are given and that the intrinsic parameters are known but the camera poses and the world point positions are not. We prove that t...
David Nistér, Frederik Schaffalitzky
CSL
2001
Springer
13 years 12 months ago
Constrained Hyper Tableaux
Hyper tableau reasoning is a version of clausal form tableau reasoning where all negative literals in a clause are resolved away in a single inference step. Constrained hyper table...
Jan van Eijck