492 search results - page 53 / 99 » Fast data stream algorithms using associative memories |
STOC
2010
ACM
14 years 17 days ago
2010
ACM
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMSâ...
INFOCOM
1995
IEEE
13 years 11 months ago
1995
IEEE
Modern high speed networks and ATM networks in particular use resource reservation as a basic means of establishing communications. One-way on-the- y reservation is a method for...
APLAS
2004
ACM
2004
ACM
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
14 years 1 months ago
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
HIPC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
ICS
2000
Tsinghua U.
13 years 11 months ago
2000
Tsinghua U.
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...