492 search results - page 50 / 99 » Fast data stream algorithms using associative memories |
ORL
1998
13 years 7 months ago
1998
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
JRTIP
2008
13 years 7 months ago
2008
Abstract In an effort to achieve lower bandwidth requirements, video compression algorithms have become increasingly complex. Consequently, the deployment of these algorithms on Fi...
ICMCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We present an implementation of general FFTs for graphics processing units (GPUs). Unlike most existing GPU FFT implementations, we handle both complex and real data of any size t...
IPPS
2000
IEEE
14 years 3 days ago
2000
IEEE
Abstract. Multimedia servers are increasingly employing parallel systems for the retrieval, scheduling and delivery of streaming multimedia content. However, given non-zero blockin...
PDPTA
2000
13 years 9 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...