Results 1 - 10 of 1,040

Compressed Bloom Filters

by Michael Mitzenmacher , 2001
"... A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, for many applications the space savings outweigh this drawback when the probability of an error is sufficiently low. We in ..."
Abstract - Cited by 255 (8 self) - Add to MetaCart
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, for many applications the space savings outweigh this drawback when the probability of an error is sufficiently low. We

Compression Planner for Time Series Database with GPU Support

by Piotr Przymus , ( B , Krzysztof Kaczmarski
"... Abstract. Nowadays, we can observe increasing interest in processing and exploration of time series. Growing volumes of data and needs of efficient processing pushed research in new directions. This paper presents a lossless lightweight compression planner intended to be used in a time series datab ..."
Abstract - Add to MetaCart
Abstract. Nowadays, we can observe increasing interest in processing and exploration of time series. Growing volumes of data and needs of efficient processing pushed research in new directions. This paper presents a lossless lightweight compression planner intended to be used in a time series

Acceleration of GPU-based ultrasound simulation via data compression

by Andrew A. Haigh, Eric C. Mccreath
"... Abstract—The realistic simulation of ultrasound wave propa-gation is computationally intensive. The large size of the grid and low degree of reuse of data means that it places a great demand on memory bandwidth. Graphics Processing Units (GPUs) have attracted attention for performing scientific calc ..."
Abstract - Add to MetaCart
calculations due to their potential for efficiently performing large numbers of floating point computations. However, many applications may be limited by memory bandwidth, especially for data sets whose size is larger than that of the GPU platform. This problem is only partially mitigated by applying

Dynamic compression strategy for time series database using GPU

by Piotr Przymus, Krzysztof Kaczmarski - In ADBIS , 2013
"... Abstract. Nowadays, we can observe increasing interest in processing and exploration of time series. Growing volumes of data and needs of efficient processing pushed research in new directions. GPU devices combined with fast compression and decompression algorithms open new horizons for data intensi ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
Abstract. Nowadays, we can observe increasing interest in processing and exploration of time series. Growing volumes of data and needs of efficient processing pushed research in new directions. GPU devices combined with fast compression and decompression algorithms open new horizons for data

Vx32: Lightweight userlevel sandboxing on the x86

by Bryan Ford, Russ Cox - In Proceedings of the USENIX Annual Technical Conference , 2008
"... Code sandboxing is useful for many purposes, but most sandboxing techniques require kernel modifications, do not completely isolate guest code, or incur substantial performance costs. Vx32 is a multipurpose user-level sandbox that enables any application to load and safely execute one or more guest ..."
Abstract - Cited by 70 (2 self) - Add to MetaCart
program from both reads and writes by its guests; and it allows the host to restrict the instruction set available to guests. The key to vx32’s combination of portability, flexibility, and efficiency is its use of x86 segmentation hardware to sandbox the guest’s data accesses, along with a lightweight

Energy Aware Lossless Data Compression

by Kenneth Barr, Krste Asanović - MOBISYS 2003 , 2003
"... Wireless transmission of a bit can require over 1000 times more energy than a single 32-bit computation. It would therefore seem desirable to perform significant computation to reduce the number of bits transmitted. If the energy required to compress data is less than the energy required to send it, ..."
Abstract - Cited by 88 (0 self) - Add to MetaCart
before transmission. Reasons for this increase are explained, and hardwareaware programming optimizations are demonstrated. When applied to Unix compress, these optimizations improve energy efficiency by 51%. We also explore the fact that, for many usage models, compression and decompression need

Coil sensitivity encoding for fast MRI. In:

by Klaas P Pruessmann , Markus Weiger , Markus B Scheidegger , Peter Boesiger - Proceedings of the ISMRM 6th Annual Meeting, , 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract - Cited by 193 (3 self) - Add to MetaCart
complementary to Fourier preparation by linear field gradients. Thus, by using multiple receiver coils in parallel scan time in Fourier imaging can be considerably reduced. The problem of image reconstruction from sensitivity encoded data is formulated in a general fashion and solved for arbitrary coil

Partial Encryption of Compressed Images and Videos

by Howard Cheng, Xiaobo Li , 2000
"... The increased popularity of multimedia applications places a great demand on efficient data storage and transmission techniques. Network communication, especially over a wireless network, can easily be intercepted and must be protected from eavesdroppers. Unfortunately, encryption and decryption ..."
Abstract - Cited by 112 (1 self) - Add to MetaCart
computationally intensive. We propose a novel solution, called partial encryption, in which a secure encryption algorithm is used to encrypt only part of the compressed data. Partial encryption is applied to several image and video compression algorithms in this paper. Only 13%--27% of the output from

Data Compression Algorithms for Energy-Constrained Devices in Delay Tolerant Networks

by Christopher M. Sadler, Margaret Martonosi - In Proc. of the ACM Conf. on Embedded Networked Sensor Systems (SenSys , 2006
"... Sensor networks are fundamentally constrained b y the difficulty and energy expense of delivering information from sensors to sink. Our work has focused on garnerin g additional significant energ y improvements b y d ev isin g computationally-efficient lossless compression algorithms on the source n ..."
Abstract - Cited by 109 (2 self) - Add to MetaCart
Sensor networks are fundamentally constrained b y the difficulty and energy expense of delivering information from sensors to sink. Our work has focused on garnerin g additional significant energ y improvements b y d ev isin g computationally-efficient lossless compression algorithms on the source

Efficient CPU-GPU Work Sharing for

by Data-parallel Javascript Workloads, Xianglan Piao, Channoh Kim, Younghwan Oh, Hanjun Kim, Jae W. Lee
"... Modern web browsers are required to execute many complex, compute-intensive applications, mostly written in JavaScript. With widespread adoption of heterogeneous processors, re-cent JavaScript-based data-parallel programming models, such as River Trail and WebCL, support multiple types of processing ..."
Abstract - Add to MetaCart
Modern web browsers are required to execute many complex, compute-intensive applications, mostly written in JavaScript. With widespread adoption of heterogeneous processors, re-cent JavaScript-based data-parallel programming models, such as River Trail and WebCL, support multiple types
Results 1 - 10 of 1,040