Sciweavers

4759 search results - page 272 / 952
» Parallelizing the Phylogeny Problem
Sort
View
124
Voted
ARTS
1999
Springer
15 years 6 months ago
Process Algebra with Probabilistic Choice
Published results show that various models may be obtained by combining parallel composition with probability and with or without non-determinism. In this paper we treat this probl...
Suzana Andova
109
Voted
LATIN
1998
Springer
15 years 6 months ago
The CREW PRAM Complexity of Modular Inversion
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
Joachim von zur Gathen, Igor Shparlinski
128
Voted
SIGCSE
1997
ACM
111views Education» more  SIGCSE 1997»
15 years 6 months ago
Teaching an engineering approach for network computing
Parallelism and concurrency have long been considered as non essential during the cursus of the average programmer. However, thanks to technological advances, new promising forms ...
Eric Dillon, Carlos Gamboa Dos Santos, Jacques Guy...
116
Voted
HPCS
2009
IEEE
15 years 6 months ago
FFT-Based Dense Polynomial Arithmetic on Multi-cores
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study...
Marc Moreno Maza, Yuzhen Xie
129
Voted
CONCUR
2005
Springer
15 years 4 months ago
The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation
Abstract. Delaying the synchronization of actions may reveal some hidden behavior that would not happen if the synchronization met the specified deadlines. This precise phenomenon...
Pedro R. D'Argenio, Biniam Gebremichael