Sciweavers

144 search results - page 10 / 29
» Decision tree modeling with relational views
Sort
View
IDEAS
2005
IEEE
137views Database» more  IDEAS 2005»
14 years 1 months ago
Order-Sensitive XML Query Processing over Relational Sources: An Algebraic Approach
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...
Ling Wang, Song Wang, Brian Murphy, Elke A. Runden...
STACS
2005
Springer
14 years 1 months ago
Robust Polynomials and Quantum Algorithms
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
Harry Buhrman, Ilan Newman, Hein Röhrig, Rona...
CORR
2002
Springer
132views Education» more  CORR 2002»
13 years 7 months ago
Nonmonotonic Reasoning, Preferential Models and Cumulative Logics
Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always ...
Sarit Kraus, Daniel J. Lehmann, Menachem Magidor
TPLP
2008
89views more  TPLP 2008»
13 years 7 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...
CP
1997
Springer
14 years 23 hour ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...