Sciweavers

1675 search results - page 76 / 335
» Implementing Data Cubes Efficiently
Sort
View
AMAST
2006
Springer
14 years 1 months ago
Data Movement Optimisation in Point-Free Form
Programs written in point-free form express computation purely in terms of functions. Such programs are especially amenable to local transformation. In this paper, we describe a pr...
Brad Alexander, Andrew L. Wendelborn
PADL
2009
Springer
14 years 10 months ago
Using Bloom Filters for Large Scale Gene Sequence Analysis in Haskell
Analysis of biological data often involves large data sets and computationally expensive algorithms. Databases of biological data continue to grow, leading to an increasing demand ...
Ketil Malde, Bryan O'Sullivan
FAST
2008
14 years 9 days ago
Pergamum: Replacing Tape with Energy Efficient, Reliable, Disk-Based Archival Storage
As the world moves to digital storage for archival purposes, there is an increasing demand for reliable, lowpower, cost-effective, easy-to-maintain storage that can still provide ...
Mark W. Storer, Kevin M. Greenan, Ethan L. Miller,...
MST
2006
136views more  MST 2006»
13 years 10 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
ICIP
2002
IEEE
14 years 11 months ago
An efficient packetization algorithm for JPEG2000
This paper presents an efficient algorithm for post compression optimal rate allocation and packetization within JPEG2000 encoding. JPEG2000, the new ISO/ITU-T standard for still ...
Wei Yu Fritts, J. Tangting Sun