21324 search results - page 352 / 4265 » Making the case for computing |
165
Voted
CASES
2001
ACM
15 years 8 months ago
2001
ACM
The rapid growth of silicon densities has made it feasible to deploy reconfigurable hardware as a highly parallel computing platform. However, in most cases, the application needs...
139
Voted
HIPEAC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. High end routers are targeted at providing worst case throughput guarantees over latency. Caches on the other hand are meant to help latency not throughput in a tradition...
160
click to vote
STACS
2001
Springer
15 years 9 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
141
click to vote
FCT
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
132
click to vote
JSC
2000
15 years 4 months ago
2000
The orbits of a minimal parabolic k-subgroup acting on a symmetric k-variety are essential to the study of symmetric k-varieties and their representations. This paper gives an algo...