Sciweavers

969 search results - page 81 / 194
» Clustering performance data efficiently at massive scales
Sort
View
193
Voted
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
16 years 29 days ago
Asynchronous view maintenance for VLSD databases
The query models of the recent generation of very large scale distributed (VLSD) shared-nothing data storage systems, including our own PNUTS and others (e.g. BigTable, Dynamo, Ca...
Parag Agrawal, Adam Silberstein, Brian F. Cooper, ...
ASPLOS
1996
ACM
15 years 4 months ago
Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
Daniel J. Scales, Kourosh Gharachorloo, Chandramoh...
123
Voted
BMCBI
2006
116views more  BMCBI 2006»
15 years 24 days ago
Cluster analysis for DNA methylation profiles having a detection threshold
Background: DNA methylation, a molecular feature used to investigate tumor heterogeneity, can be measured on many genomic regions using the MethyLight technology. Due to the combi...
Paul Marjoram, Jing Chang, Peter W. Laird, Kimberl...
ECML
2006
Springer
15 years 4 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
107
Voted
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
15 years 4 months ago
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
Hans-Peter Kriegel, Bernhard Seeger