A framework for solving sequence problem of multiple input streams
From MaRDI portal
Publication:3065616
DOI10.1142/S0129054107005121zbMATH Open1202.68037MaRDI QIDQ3065616FDOQ3065616
Authors: Cho-Chin Lin 
Publication date: 6 January 2011
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
- Computing parameters of sequence-based dynamic graphs
- Sequence submodular maximization meets streaming
- Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences
- A generic framework for computing parameters of sequence-based dynamic graphs
- Sequence submodular maximization meets streaming
Cites Work
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Introduction to algorithms
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- New strategies for assigning real-time tasks to multiprocessor systems
- Efficient collective communication in distributed heterogeneous systems.
- Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences
- Broadcast scheduling optimization for heterogeneous cluster systems
- Load-skewing task assignment to minimize communication conflicts on network of workstations
This page was built for publication: A framework for solving sequence problem of multiple input streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3065616)
