Sciweavers

648 search results - page 56 / 130
» Lowness for Demuth Randomness
Sort
View
ICDT
2005
ACM
124views Database» more  ICDT 2005»
15 years 3 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
14 years 10 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
VLDB
2005
ACM
132views Database» more  VLDB 2005»
15 years 10 months ago
Hash-based labeling techniques for storage scaling
Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...
Shu-Yuen Didi Yao, Cyrus Shahabi, Per-Åke Larson
GLVLSI
2005
IEEE
118views VLSI» more  GLVLSI 2005»
15 years 3 months ago
High-diagnosability online built-in self-test of FPGAs via iterative bootstrapping
We develop a novel on-line built-in self-test (BIST) technique for testing FPGAs that has a very high diagnosability even in presence of clustered faults, a fault pattern for whic...
Vishal Suthar, Shantanu Dutt
STACS
2005
Springer
15 years 3 months ago
Roundings Respecting Hard Constraints
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
Benjamin Doerr