272 search results - page 16 / 55 » Lazy tree splitting |
IJFCS
1998
13 years 7 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper proposes a new single-frame image upconversion approach that uses prior information. The proposed method overcomes the drawbacks of the Kondo 2001 where the class membe...
FLAIRS
2001
13 years 9 months ago
2001
A maximal prime subgraph decomposition junction tree (MPD-JT) is a useful computational structure that facilitates lazy propagation in Bayesian networks (BNs). A graphical method ...
KDD
1999
ACM
13 years 12 months ago
1999
ACM
Satisfying the basic requirements of accuracy and understandability of a classifier, decision tree classifiers have become very popular. Instead of constructing the decision tree ...
EDBT
2000
ACM
13 years 11 months ago
2000
ACM
The MIX mediator systems incorporates a novel framework for navigation-driven evaluation of virtual mediated views. Its architecture allows the on-demand computation of views and q...