Sciweavers

2124 search results - page 100 / 425
» Repairing Structurally Complex Data
Sort
View
CIKM
1997
Springer
14 years 2 months ago
Learning Belief Networks from Data: An Information Theory Based Approach
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
Jie Cheng, David A. Bell, Weiru Liu
DLOG
2008
14 years 1 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
VMCAI
2010
Springer
14 years 8 months ago
Collections, Cardinalities, and Relations
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
Kuat Yessenov, Ruzica Piskac, Viktor Kuncak
ESA
2008
Springer
73views Algorithms» more  ESA 2008»
14 years 16 days ago
On the Size of the 3D Visibility Skeleton: Experimental Results
Abstract. The 3D visibility skeleton is a data structure used to encode global visibility information about a set of objects. Previous theoretical results have shown that for k con...
Linqiao Zhang, Hazel Everett, Sylvain Lazard, Chri...
CVPR
2010
IEEE
14 years 1 months ago
Robust Piecewise-Planar 3D Reconstruction and Completion from Large-Scale Unstructured Point Data
In this paper, we present a novel method, the first to date to our knowledge, which is capable of directly and automatically producing a concise and idealized 3D representation f...
Anne-Laure Chauve, Patrick Labatut, Jean-Philippe ...