◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Xiaoxiao Sun

4 papers hereh-index 370 citations11 works total

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

author position
  • first author1
  • last author1

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

fields
  • cs.CV1
  • cs.SI1
  • math.AP1
  • stat.ML1
same name
  • Xiaoxiao Sun — 5 papers, h 2
  • Xiaoxiao Sun — 4 papers, h 8
  • Xiaoxiao Sun — 4 papers, h 3
  • Xiaoxiao Sun — 3 papers, h 9
  • Xiaoxiao Sun — 3 papers, h 2
  • Xiaoxiao Sun — 2 papers, h 7

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

most citedA Feasible Graph Partition Framework for Random Walks Implemented by Parallel Computing in Big Graph

2 citations · 2 across the 3 of their papers we have counts for

collaborators

4 papers

math.AP2021

Critical local well-posedness for the fully nonlinear Peskin problem

Stephen Cameron, Robert M. Strain

We study the problem where a one-dimensional elastic string is immersed in a two-dimensional steady Stokes fluid. This is known as the Stokes immersed boundary problem and also as…

cs.CV2021

Ranking Models in Unlabeled New Environments

Xiaoxiao Sun, Yunzhong Hou, Weijian Deng +2

Consider a scenario where we are supplied with a number of ready-to-use models trained on a certain source domain and hope to directly apply the most appropriate ones to different…

stat.ML2021

Oversampling Divide-and-conquer for Response-skewed Kernel Ridge Regression

Jingyi Zhang, Xiaoxiao Sun

The divide-and-conquer method has been widely used for estimating large-scale kernel ridge regression estimates. Unfortunately, when the response variable is highly skewed, the div…

cs.SI2014★ 2 cited

A Feasible Graph Partition Framework for Random Walks Implemented by Parallel Computing in Big Graph

Xiaoming Liu, Yadong Zhou, Xiaohong Guan

Graph partition is a fundamental problem of parallel computing for big graph data. Many graph partition algorithms have been proposed to solve the problem in various applications,…

◍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.