1984 search results - page 151 / 397 » Binary Component Adaptation |
104
click to vote
WIA
2005
Springer
15 years 9 months ago
2005
Springer
There has been several attempts over the years to solve the bisimulation minimization problem for finite automata. One of the most famous algorithms is the one suggested by Paige ...
135
click to vote
SMA
2003
ACM
15 years 9 months ago
2003
ACM
We present a method to estimate the in/out function of a closed surface represented by an unorganized set of data points. From the in/out function, we compute an approximation of ...
129
click to vote
ASPDAC
2007
ACM
15 years 8 months ago
2007
ACM
Parallel prefix adder is the most flexible and widely-used binary adder for ASIC designs. Many high-level synthesis techniques have been developed to find optimal prefix structures...
153
click to vote
CASES
2008
ACM
15 years 6 months ago
2008
ACM
Java applications rely on Just-In-Time (JIT) compilers or adaptive compilers to generate and optimize binary code at runtime to boost performance. In conventional Java Virtual Mac...
141
Voted
SDM
2003
SIAM
15 years 5 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...