Sciweavers

356 search results - page 40 / 72
» Parallelizing time with polynomial circuits
Sort
View
IPPS
2003
IEEE
14 years 2 months ago
Master-slave Tasking on Heterogeneous Processors
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
Pierre-François Dutot
IPPS
1997
IEEE
14 years 1 months ago
Broadcasting and Multicasting in Cut-through Routed Networks
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
Johanne Cohen, Pierre Fraigniaud, Jean-Claude K&ou...
DSD
2008
IEEE
95views Hardware» more  DSD 2008»
14 years 3 months ago
Programmable Numerical Function Generators for Two-Variable Functions
This paper proposes a design method and programmable architectures for numerical function generators (NFGs) of two-variable functions. To realize a two-variable function in hardwa...
Shinobu Nagayama, Jon T. Butler, Tsutomu Sasao
DAM
2007
107views more  DAM 2007»
13 years 9 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
14 years 1 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or