Jiapeng Zhang

Orcid: 0000-0003-0680-781X

According to our database1, Jiapeng Zhang authored at least 70 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Self-supervised global graph neural networks with enhance-attention for session-based recommendation.
Appl. Soft Comput., January, 2024

A New Information Complexity Measure for Multi-pass Streaming with Applications.
CoRR, 2024

Deep Rib Fracture Instance Segmentation and Classification from CT on the RibFrac Challenge.
CoRR, 2024

ViTFSL-Baseline: A Simple Baseline of Vision Transformer Network for Few-Shot Image Classification.
IEEE Access, 2024

Detecting Hidden Communities by Power Iterations with Connections to Vanilla Spectral Algorithms.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Dual-Branch TransV-Net for 3-D Echocardiography Segmentation.
IEEE Trans. Ind. Informatics, December, 2023

Neighbor-Augmented Knowledge Graph Attention Network for Recommendation.
Neural Process. Lett., December, 2023

Online bionic visual siamese tracking based on mixed time-event triggering mechanism.
Multim. Tools Appl., April, 2023

On Social Network De-Anonymization With Communities: A Maximum A Posteriori Perspective.
IEEE Trans. Knowl. Data Eng., March, 2023

Toward Purifying Defect Feature for Multilabel Sewer Defect Classification.
IEEE Trans. Instrum. Meas., 2023

Road Extraction From Satellite Imagery by Road Context and Full-Stage Feature.
IEEE Geosci. Remote. Sens. Lett., 2023

Communication Lower Bounds for Collision Problems via Density Increment Arguments.
Electron. Colloquium Comput. Complex., 2023

Communication Complexity of Set-Intersection Problems and Its Applications.
Electron. Colloquium Comput. Complex., 2023

Streaming Lower Bounds and Asymmetric Set-Disjointness.
Electron. Colloquium Comput. Complex., 2023

Communication Lower Bounds of Key-Agreement Protocols via Density Increment Arguments.
Electron. Colloquium Comput. Complex., 2023

Lifting Theorems Meet Information Complexity: Known and New Lower Bounds of Set-disjointness.
CoRR, 2023

A Lightweight Domain Adversarial Neural Network Based on Knowledge Distillation for EEG-based Cross-subject Emotion Recognition.
CoRR, 2023

Recovering Unbalanced Communities in the Stochastic Block Model with Application to Clustering with a Faulty Oracle.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On the Power of SVD in the Stochastic Block Model.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

LDTSF: A Label-Decoupling Teacher-Student Framework for Semi-Supervised Echocardiography Segmentation.
Proceedings of the IEEE International Conference on Acoustics, 2023

2022
Measuring Social Network De-Anonymizability by Means of Morphism Property.
IEEE/ACM Trans. Netw., 2022

Sunflowers and Robust Sunflowers from Randomness Extractors.
Theory Comput., 2022

Collective De-Anonymization of Social Networks With Optional Seeds.
IEEE Trans. Mob. Comput., 2022

A Driving Behavior Risk Classification Framework via the Unbalanced Time Series Samples.
IEEE Trans. Instrum. Meas., 2022

Spatial-Temporal Feature Fusion Neural Network for EEG-Based Emotion Recognition.
IEEE Trans. Instrum. Meas., 2022

Multiple organ-specific cancers classification from PET/CT images using deep learning.
Multim. Tools Appl., 2022

TransRoadNet: A Novel Road Extraction Method for Remote Sensing Images via Combining High-Level Semantic Feature and Context.
IEEE Geosci. Remote. Sens. Lett., 2022

Uncertain motion tracking via target-objectness proposal and memory validation.
Inf. Sci., 2022

Residual memory inference network for regression tracking with weighted gradient harmonized loss.
Inf. Sci., 2022

Simulation Methods in Communication Lower Bounds, Revisited.
Electron. Colloquium Comput. Complex., 2022

Non-Adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions.
Electron. Colloquium Comput. Complex., 2022

Fractional certificates for bounded functions.
Electron. Colloquium Comput. Complex., 2022

Confident Clustering via PCA Compression Ratio and Its Application to Single-cell RNA-seq Analysis.
CoRR, 2022

Compressibility: Power of PCA in Clustering Problems Beyond Dimensionality Reduction.
CoRR, 2022

TCRAN: Multivariate time series classification using residual channel attention networks with time correction.
Appl. Soft Comput., 2022

Dual-Branch Memory Network for Visual Object Tracking.
Proceedings of the Pattern Recognition and Computer Vision - 5th Chinese Conference, 2022

Self-pretrained V-Net Based on PCRL for Abdominal Organ Segmentation.
Proceedings of the Fast and Low-Resource Semi-supervised Abdominal Organ Segmentation, 2022

Lifting with Sunflowers.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Decision List Compression by Mild Random Restrictions.
J. ACM, 2021

Simple Constructions from (Almost) Regular One-Way Functions.
IACR Cryptol. ePrint Arch., 2021

De-anonymizing Social Networks Under Partial Overlap: An F-score Based Approach.
Proceedings of the 40th IEEE Conference on Computer Communications, 2021

Digital Twin-Based Three-Dimensional Visual and Global Monitoring of Assembly Shop-Floor.
Proceedings of the CSAE 2021: The 5th International Conference on Computer Science and Application Engineering, Sanya, China, October 19, 2021

Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle.
Proceedings of the Conference on Learning Theory, 2021

2020
De-Anonymizing Social Networks With Overlapping Community Structure.
IEEE/ACM Trans. Netw., 2020

Unifying Presampling via Concentration Bounds.
IACR Cryptol. ePrint Arch., 2020

Improved lifting theorems via robust sunflowers.
Electron. Colloquium Comput. Complex., 2020

A Novel Prediction Method Based on Improved Binary Glowworm Swarm Optimization and Multi-Fractal Dimension for P2P Lending Investment Risk.
IEEE Access, 2020

De-anonymization of Social Networks: the Power of Collectiveness.
Proceedings of the 39th IEEE Conference on Computer Communications, 2020

2019
Discrete Fourier Analysis and Its Applications.
PhD thesis, 2019

Core Percolation in Interdependent Networks.
IEEE Trans. Netw. Sci. Eng., 2019

From DNF compression to sunflower theorems via regularity.
Electron. Colloquium Comput. Complex., 2019

Improved bounds for the sunflower lemma.
Electron. Colloquium Comput. Complex., 2019

2018
DNF sparsification beyond sunflowers.
Electron. Colloquium Comput. Complex., 2018

Sunflowers and Quasi-sunflowers from Randomness Extractors.
Electron. Colloquium Comput. Complex., 2018

Quantum Lovász Local Lemma: Shearer's Bound is Tight.
Electron. Colloquium Comput. Complex., 2018

A Tight Lower Bound for Entropy Flattening.
Electron. Colloquium Comput. Complex., 2018

The Robust Sensitivity of Boolean Functions.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Optimal Beamforming in Cooperative Cognitive Backscatter Networks for Wireless-Powered IoT.
Proceedings of the IEEE International Conference on Communication Systems, 2018

2017
Active classification with comparison queries.
Electron. Colloquium Comput. Complex., 2017

Multi-spectrum superpixel based obstacle detection under vegetation environments.
Proceedings of the IEEE Intelligent Vehicles Symposium, 2017

Cyber attacks on remote relays in smart grid.
Proceedings of the 2017 IEEE Conference on Communications and Network Security, 2017

2016
Robust sensitivity.
Electron. Colloquium Comput. Complex., 2016

On the impossibility of entropy reversal, and its application to zero-knowledge proofs.
Electron. Colloquium Comput. Complex., 2016

Noisy Population Recovery from Unknown Noise.
Electron. Colloquium Comput. Complex., 2016

2015
Barriers to Black-Box Constructions of Traitor Tracing Systems.
Electron. Colloquium Comput. Complex., 2015

On the measurement complexity of differentially private query answering.
Sci. China Inf. Sci., 2015

2014
Improved noisy population recovery, and reverse Bonami-Beckner inequality for sparse functions.
Electron. Colloquium Comput. Complex., 2014

Utilizing path dynamics for delay assurance in synchronized multihop scheduling.
Proceedings of the 23rd International Conference on Computer Communication and Networks, 2014

2013
A Privacy-Preserving Reauthentication Scheme for Mobile Wireless Sensor Networks.
Int. J. Distributed Sens. Networks, 2013

2011
On the query complexity for Showing Dense Model.
Electron. Colloquium Comput. Complex., 2011


  Loading...