1149 search results - page 8 / 230 » Minimally non-Pfaffian graphs |
WEA
2005
Springer
14 years 25 days ago
2005
Springer
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...
DATE
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract - This paper describes an efficient graphbased method to optimize data-flow expressions for best hardware implementation. The method is based on factorization, common su...
ASPDAC
2009
ACM
14 years 1 months ago
2009
ACM
SCALESPACE
2007
Springer
14 years 1 months ago
2007
Springer
ESA
2004
Springer
14 years 22 days ago
2004
Springer