Sciweavers

306 search results - page 51 / 62
» Underspecified computation of normal forms
Sort
View
AAAI
2006
13 years 9 months ago
Compilation of Query-Rewriting Problems into Tractable Fragments of Propositional Logic
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...
Yolifé Arvelo, Blai Bonet, Maria-Esther Vid...
AAAI
2006
13 years 9 months ago
DNNF-based Belief State Estimation
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
Paul Elliott, Brian C. Williams
FLAIRS
2004
13 years 9 months ago
Splitting Ratios: Metric Details of Topological Line-Line Relations
Within the geographic domain, an important class of relies on geometric abstractions in the form of lines where, for instance, transportation networks and trajectories of movement...
Konstantinos A. Nedas, Max J. Egenhofer
EGITALY
2006
13 years 9 months ago
3D Data Segmentation Using a Non-Parametric Density Estimation Approach
In this paper, a new segmentation approach for sets of 3D unorganized points is proposed. The method is based on a clustering procedure that separates the modes of a non-parametri...
Umberto Castellani, Marco Cristani, Vittorio Murin...
ACTA
2007
92views more  ACTA 2007»
13 years 7 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider