Sciweavers

2834 search results - page 70 / 567
» Representing Trees with Constraints
Sort
View
IJAR
2007
87views more  IJAR 2007»
13 years 8 months ago
Pruning belief decision tree methods in averaging and conjunctive approaches
The belief decision tree (BDT) approach is a decision tree in an uncertain environment where the uncertainty is represented through the Transferable Belief Model (TBM), one interp...
Salsabil Trabelsi, Zied Elouedi, Khaled Mellouli
SIGMOD
2005
ACM
136views Database» more  SIGMOD 2005»
14 years 2 months ago
Optimizing recursive queries in SQL
Recursion represents an important addition to the SQL language. This work focuses on the optimization of linear requeries in SQL. To provide an abstract framework for discussion, ...
Carlos Ordonez
FOIKS
2008
Springer
13 years 10 months ago
SIM-PDT: A Similarity Based Possibilistic Decision Tree Approach
This paper investigates an extension of classification trees to deal with uncertain information where uncertainty is encoded in possibility theory framework. Class labels in data s...
Ilyes Jenhani, Nahla Ben Amor, Salem Benferhat, Zi...
SEKE
2007
Springer
14 years 3 months ago
Query Processing in Paraconsistent Databases in the Presence of Integrity Constraints
In this paper, we present an approach to query processing for paraconsistent databases in the presence of integrity constraints. Paraconsistent databases are capable of representi...
Navin Viswanath, Rajshekhar Sunderraman
CP
2008
Springer
13 years 10 months ago
Flow-Based Propagators for the SEQUENCE and Related Global Constraints
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE...
Michael J. Maher, Nina Narodytska, Claude-Guy Quim...