Sciweavers

304 search results - page 31 / 61
» Parallel and Distributed Compressed Indexes
Sort
View
GRID
2008
Springer
13 years 8 months ago
Building a Peer-to-peer Information System in Grids via Self-organizing Agents
A Grid information system should rely upon two basic features: the replication and dissemination of information about Grid services and resources, and the distribution of such info...
Agostino Forestiero, Carlo Mastroianni, Giandomeni...
IDEAS
1999
IEEE
175views Database» more  IDEAS 1999»
14 years 24 days ago
A Parallel Scalable Infrastructure for OLAP and Data Mining
Decision support systems are important in leveraging information present in data warehouses in businesses like banking, insurance, retail and health-care among many others. The mu...
Sanjay Goil, Alok N. Choudhary
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 13 days ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
BMCBI
2010
132views more  BMCBI 2010»
13 years 8 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
DCC
2004
IEEE
14 years 8 months ago
Slepian-Wolf Coding for Nonuniform Sources Using Turbo Codes
The recently proposed turbo-binning scheme is shown to be both efficient and optimal for uniform source Slepian-Wolf coding problem [1]. This paper studies the case when sources a...
Jing (Tiffany) Li, Zhenyu Tu, Rick S. Blum