317 search results - page 28 / 64 » Factoring logic functions using graph partitioning |
ICNP
2009
IEEE
15 years 4 months ago
2009
IEEE
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
109
click to vote
SMI
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we propose a new algorithm for the fundamental problem of reconstructing surfaces from a large set of unorganized 3D data points. The local shapes of the surface ar...
85
Voted
TCAD
2002
14 years 9 months ago
2002
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
DAWAK
2000
Springer
15 years 2 months ago
2000
Springer
In the context of multidimensional databases implemented on relational DBMSs through star schemes, the most effective technique to enhance performances consists of materializing re...