2127 search results - page 299 / 426 » Computing large matchings fast |
143
Voted
FPGA
1999
ACM
15 years 8 months ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
222
click to vote
WAE
2001
15 years 5 months ago
2001
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
130
click to vote
DAC
1999
ACM
16 years 5 months ago
1999
ACM
Matrix-implicit Krylov-subspace methods have made it possible to efficiently compute the periodic steady-state of large circuits using either the time-domain shooting-Newton metho...
136
click to vote
IWPEC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Haplotyping via perfect phylogeny is a method for retrieving haplotypes from genotypes. Fast algorithms are known for computing perfect phylogenies from complete and erro...
232
click to vote
ACISP
2000
Springer
15 years 8 months ago
2000
Springer
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. 1 Ove...