1170 search results - page 10 / 234 » How Fast Is Too Fast |
109
click to vote
DSD
2003
IEEE
15 years 6 months ago
2003
IEEE
We present a novel heuristic algorithm for two-level Boolean minimization. In contrast to the other approaches, the proposed method firstly finds the coverage of the on-sets and f...
115
click to vote
INFOVIS
2002
IEEE
15 years 5 months ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
101
Voted
VRST
2000
ACM
15 years 5 months ago
2000
ACM
Current algorithms to create depth of field (DOF) effects are either too costly to be applied in VR systems, or they produce inaccurate results. In this paper, we present a new a...
103
Voted
DAC
1999
ACM
16 years 1 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
68
Voted
ICCD
2001
IEEE
15 years 9 months ago
2001
IEEE
In 1987 Sedlak proposed a modulo multiplication algorithm which is suitable for smart card implementation due to it’s low latency time. It is based on ZDN (zwei_drittel_N) arith...