S
Shoumeng Yan
Researcher at Intel
Publications - 34
Citations - 3048
Shoumeng Yan is an academic researcher from Intel. The author has contributed to research in topics: Central processing unit & Virtual memory. The author has an hindex of 13, co-authored 30 publications receiving 2092 citations.
Papers
More filters
Proceedings ArticleDOI
Learning Efficient Convolutional Networks through Network Slimming
TL;DR: In this article, the authors proposed a network slimming method for CNNs to simultaneously reduce the model size, decrease the run-time memory footprint, and lower the number of computing operations without compromising accuracy.
Posted Content
Learning Efficient Convolutional Networks through Network Slimming
TL;DR: The approach is called network slimming, which takes wide and large networks as input models, but during training insignificant channels are automatically identified and pruned afterwards, yielding thin and compact models with comparable accuracy.
Patent
Shared virtual memory
Hu Chen,Ying Gao,Zhou Xiaocheng,Shoumeng Yan,Peinan Zhang,Mohan Rajagopalan,Jesse Fang,Avi Mendelson,Bratin Saha +8 more
TL;DR: In this paper, the authors present a programming model for CPU-GPU platforms, which allows software vendors to write a single application stack and target it to all the different platforms, and a shared memory model between the CPU and GPU.
Proceedings ArticleDOI
Programming model for a heterogeneous x86 platform
Bratin Saha,Xiaocheng Zhou,Hu Chen,Ying Gao,Shoumeng Yan,Mohan Rajagopalan,Jesse Fang,Peinan Zhang,Ronny Ronen,Avi Mendelson +9 more
TL;DR: A programming model for such heterogeneous platforms consisting of a combination of cores focused on scalar performance, and a set of throughput-oriented cores is described.
Proceedings ArticleDOI
Relationship-aware code search for JavaScript frameworks
TL;DR: This work presents a novel Relationship-Aware Code Search (RACS) approach for finding code snippets that use JavaScript frameworks to implement a specific feature, and reduces code search to the problem of graph search: finding similar MCR graphs for a given AR graph.