The Size Complexity of Strictly Non-blocking Fixed Ratio Concentrators with Constant Depth.
H. K. DaiPublished in: Euro-Par, Vol. I (1996)
Keyphrases
- space complexity
- computational complexity
- depth map
- standard deviation
- fixed size
- memory requirements
- training set size
- worst case time complexity
- fixed parameter tractable
- worst case
- depth information
- artificial intelligence
- exponential size
- replacement policy
- network size
- decision problems
- case study
- record linkage
- window size
- storage requirements
- constant factor
- bounded treewidth
- scales linearly
- polynomial size
- high quality
- website
- information retrieval