2186 search results - page 80 / 438 » Considering an Organization's Memory |
VLDB
2004
ACM
14 years 2 months ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...
DASFAA
2011
IEEE
13 years 24 days ago
2011
IEEE
Flash memories are considered a competitive alternative to rotating disks as non-volatile data storage for database management systems. However, even if the Flash Translation Layer...
ICASSP
2011
IEEE
13 years 23 days ago
2011
IEEE
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
ISW
2009
Springer
14 years 3 months ago
2009
Springer
We present ShMAC (Shallow MAC), a fixed input length message authentication code that performs most of the computation prior to the availability of the message. Specifically, Sh...