360 search results - page 34 / 72 » Timing Minimization by Statistical Timing hMetis-based Parti... |
WIA
2009
Springer
14 years 4 days ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
DAWAK
2000
Springer
13 years 12 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...
DAGM
2008
Springer
13 years 9 months ago
2008
Springer
Three-dimensional electron-microscopic image stacks with almost isotropic resolution allow, for the first time, to determine the complete connection matrix of parts of the brain. I...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
CODES
2007
IEEE
14 years 1 months ago
2007
IEEE
We present a co-synthesis approach that accelerates reactive software processing by moving the calculation of complex expressions into external combinational hardware. The startin...