Sciweavers

1146 search results - page 204 / 230
» Finite cupping sets
Sort
View
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 8 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
LCTRTS
2001
Springer
14 years 3 days ago
Middleware For Building Adaptive Systems Via Configuration
1 COTS (commercial off-the-shelf) devices are capable of executing powerful, distributed algorithms. Very large, adaptive systems can be created by simply integrating these devices...
Sanjai Narain, Ravichander Vaidyanathan, Stanley M...
VISUALIZATION
1992
IEEE
13 years 11 months ago
Display of Scientific Data Structures for Algorithm Visualization
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...
William L. Hibbard, Charles R. Dyer, Brian E. Paul
CSL
2010
Springer
13 years 8 months ago
Fibrational Induction Rules for Initial Algebras
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our res...
Neil Ghani, Patricia Johann, Clément Fumex
BMCBI
2006
124views more  BMCBI 2006»
13 years 7 months ago
Detection of divergent genes in microbial aCGH experiments
Background: Array-based comparative genome hybridization (aCGH) is a tool for rapid comparison of genomes from different bacterial strains. The purpose of such analysis is to dete...
Lars Snipen, Dirk Repsilber, Ludvig Nyquist, &Arin...