◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jie Liu

4 papers hereh-index 151.2k citations65 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author3
  • last author1

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • cs.DC2
  • cs.MS1
  • math.NA1
same name
  • Jie Liu — 82 papers, h 33
  • Jie Liu — 19 papers, h 7
  • Jie Liu — 16 papers
  • Jie Liu — 14 papers, h 21
  • Jie Liu — 14 papers, h 8
  • Jie Liu — 12 papers, h 5

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20152021
most citedNUMA-aware FFT-based Convolution on ARMv8 Many-core CPUs

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

cs.DC2021★ 1 cited

NUMA-aware FFT-based Convolution on ARMv8 Many-core CPUs

Xiandong Huang, Qinglin Wang, Shuyu Lu +3

Convolutional Neural Networks (CNNs), one of the most representative algorithms of deep learning, are widely used in various artificial intelligence applications. Convolution opera…

cs.DC2018

A New High Performance and Scalable SVD algorithm on Distributed Memory Systems

Shengguo Li, Jie Liu, Yunfei Du

This paper introduces a high performance implementation of \texttt{Zolo-SVD} algorithm on distributed memory systems, which is based on the polar decomposition (PD) algorithm via t…

cs.MS2016

An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures

Shengguo Li, Francois-Henry Rouet, Jie Liu +3

In this paper, an efficient divide-and-conquer (DC) algorithm is proposed for the symmetric tridiagonal matrices based on ScaLAPACK and the hierarchically semiseparable (HSS) matri…

math.NA2015

New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem

Shengguo Li, Xiangke Liao, Jie Liu +1

In this paper, two accelerated divide-and-conquer algorithms are proposed for the symmetric tridiagonal eigenvalue problem, which cost O(N2r) {flops} in the worst case, where $N…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.