A Fast Algorithm for Online Placement and Reorganization of Replicated Data

doi 10.1109/ipdps.2003.1213151
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE Comput. Soc

Related search

Minimum Cost Flow Based Fast Placement Algorithm

English

VIF Regression: A Fast Regression Algorithm for Large Data

2009English

Weighted Voting for Replicated Data

1979English

Fast Online Deconvolution of Calcium Imaging Data

PLoS Computational Biology
Molecular NeuroscienceEvolutionEcologyGeneticsBehaviorMolecular BiologySystematicsSimulationCellularComputational TheoryMathematicsModeling
2017English

A Fast and Accurate SNP Detection Algorithm for Next-Generation Sequencing Data

Nature Communications
AstronomyGeneticsMolecular BiologyBiochemistryChemistryPhysics
2012English

A Novel Algorithm for Fast and Scalable Subspace Clustering of High-Dimensional Data

Journal of Big Data
Information SystemsComputer NetworksHardwareCommunicationsManagementArchitecture
2015English

Replicated Data Types

2017English

Conflict Detection Tradeoffs for Replicated Data

ACM Transactions on Database Systems
Information Systems
1991English

Sequential Programming for Replicated Data Stores

Proceedings of the ACM on Programming Languages
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy