Sciweavers

356 search results - page 42 / 72
» Parallelizing time with polynomial circuits
Sort
View
IPPS
2008
IEEE
14 years 3 months ago
Symbolic expression analysis for compiled communication
Enabling circuit switching in multiprocessor systems has the potential to achieve more efficient communication with lower cost compared to packet/wormhole switching. However, in ...
Shuyi Shao, Yu Zhang, Alex K. Jones, Rami G. Melhe...
IPPS
1998
IEEE
14 years 1 months ago
Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
Shan-Chyun Ku, Biing-Feng Wang
IPPS
2007
IEEE
14 years 3 months ago
Speedup using Flowpaths for a Finite Difference Solution of a 3D Parabolic PDE
Partial differential equations (PDEs) are used to model physical phenomena and then appropriate convergent numerical algorithms are employed to solve them and create computer simu...
Darrin M. Hanna, Anna M. Spagnuolo, Michael DuChen...
DAC
2012
ACM
11 years 11 months ago
Process variation in near-threshold wide SIMD architectures
Near-threshold operation has emerged as a competitive approach for energy-efficient architecture design. In particular, a combination of near-threshold circuit techniques and par...
Sangwon Seo, Ronald G. Dreslinski, Mark Woh, Yongj...
ECCC
1998
105views more  ECCC 1998»
13 years 8 months ago
Pseudorandom generators without the XOR Lemma
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
Madhu Sudan, Luca Trevisan, Salil P. Vadhan