On the worst-case communication overhead for distributed data shuffling.
Mohamed Adel AttiaRavi TandonPublished in: Allerton (2016)
Keyphrases
- distributed data
- communication overhead
- communication cost
- worst case
- sensor networks
- data sharing
- data distribution
- distributed data mining
- lower bound
- upper bound
- np hard
- integrating heterogeneous
- data mining algorithms
- knowledge discovery
- distributed data sources
- database
- wireless sensor networks
- data management
- data streams
- file system
- decision making
- feature selection
- machine learning
- databases
- data sets
- data replication