79 search results - page 11 / 16 » Efficient breadth-first manipulation of binary decision diag... |
136
click to vote
DAC
2005
ACM
15 years 10 months ago
2005
ACM
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
110
click to vote
COMPSAC
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
DAC
1997
ACM
15 years 1 months ago
1997
ACM
Binary Decision Diagrams BDDs are e cient at manipulating large sets in a compact manner. BDDs, however, are inefcient at utilizing the memory hierarchy of the computer. Recent ...
100
click to vote
COMPGEOM
2001
ACM
15 years 1 months ago
2001
ACM
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
DIS
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we propose a method for discovering hidden information from large-scale item set data based on the symmetry of items. Symmetry is a fundamental concept in the theory...