1805 search results - page 107 / 361 » A Theory of Closure Operators |
243
Voted
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
This paper explores an inherent tension in modeling and querying uncertain data: simple, intuitive representations of uncertain data capture many application requirements, but the...
230
click to vote
PODS
2009
ACM
16 years 5 months ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
134
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
We introduce a novel framework (BLOSOM) for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: p...
158
Voted
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
In the demonstration, we will present the concepts and an implementation of an inductive database ? as proposed by Imielinski and Mannila ? in the relational model. The goal is to...
129
click to vote
FROCOS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...