Sciweavers

8728 search results - page 313 / 1746
» On Reduct Construction Algorithms
Sort
View
HPCC
2007
Springer
15 years 10 months ago
Power-Aware Fat-Tree Networks Using On/Off Links
Abstract. Nowadays, power consumption reduction techniques are being increasingly used in computer systems, and high-performance computing systems are not an exception. In particul...
Marina Alonso, Salvador Coll, Vicente Santonja, Ju...
168
Voted
STOC
2005
ACM
145views Algorithms» more  STOC 2005»
16 years 7 months ago
On uniform amplification of hardness in NP
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...
Luca Trevisan
206
Voted
CLUSTER
2001
IEEE
15 years 10 months ago
Parallel Standard Cell Placement on a Cluster of Workstations
In this paper we report experiences on a parallel implementation of a standard cell placement algorithm on a cluster of myrinet connected PCs. The proposed algorithm is based on a...
Faris H. Khundakjie, Patrick H. Madden, Nael B. Ab...
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
16 years 1 months ago
Small-Bias Spaces for Group Products
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
Raghu Meka, David Zuckerman
CADE
1999
Springer
15 years 11 months ago
A dynamic programming approach to categorial deduction
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
Philippe de Groote