2911 search results - page 362 / 583 » A Logic of Graph Constraints |
159
click to vote
DMDW
2001
15 years 8 months ago
2001
Accurately estimating the cardinality of aggregate views is crucial for logical and physical design of data warehouses. While the warehouse is under development and data are not a...
182
click to vote
AAAI
1997
15 years 8 months ago
1997
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
171
click to vote
AAAI
1994
15 years 8 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
158
click to vote
CVIU
2004
15 years 6 months ago
2004
We present a new representation and recognition method for human activities. An activity is considered to be composed of action threads, each thread being executed by a single act...
161
click to vote
TCS
2002
15 years 6 months ago
2002
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...