200 search results - page 4 / 40 » What Graphs can be Efficiently Represented by BDDs |
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
To have a robust and informative image content representation for image categorization, we often need to extract as many as possible visual features at various locations, scales a...
SAS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to class...
CAP
2010
13 years 2 months ago
2010
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
AGP
1994
IEEE
13 years 11 months ago
1994
IEEE
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
CSMR
2008
IEEE
14 years 1 months ago
2008
IEEE
Databases are continuously evolving environments, where design constructs are added, removed or updated rather often. Small changes in the database configurations might impact a l...