2 citations · 5 across the 6 of their papers we have counts for
6 papers
LookME: Lookup-Based Multimodal Embeddings for Layer Injection in Vision-Language Models
Zeyu Xu, Xingzhong Hou, Pengkai Guo +6
Vision-Language Models (VLMs) have achieved strong progress in multimodal understanding. However, scaling dense or sparse Mixture-of-Experts (MoE) models to improve performance lim…
Towards Seamless Borders: A Method for Mitigating Inconsistencies in Image Inpainting and Outpainting
Xingzhong Hou, Jie Wu, Boxiao Liu +5
Image inpainting is the task of reconstructing missing or damaged parts of an image in a way that seamlessly blends with the surrounding content. With the advent of advanced genera…
See Further When Clear: Curriculum Consistency Model
Yunpeng Liu, Boxiao Liu, Yi Zhang +4
Significant advances have been made in the sampling efficiency of diffusion models and flow matching models, driven by Consistency Distillation (CD), which trains a student model t…
An Efficient Pruning Process with Locality Aware Exploration and Dynamic Graph Editing for Subgraph Matching
Zite Jiang, Boxiao Liu, Shuai Zhang +3
Subgraph matching is a NP-complete problem that extracts isomorphic embeddings of a query graph in a data graph . In this paper, we present a framework with three components…
Fast and Efficient Parallel Breadth-First Search with Power-law Graph Transformation
Zite Jiang, Tao Liu, Shuai Zhang +3
In the big data era, graph computing is widely used to exploit the hidden value in real-world graphs in various scenarios such as social networks, knowledge graphs, web searching,…
An Efficient and Balanced Graph Partition Algorithm for the Subgraph-Centric Programming Model on Large-scale Power-law Graphs
Shuai Zhang, Zite Jiang, Xingzhong Hou +3
The subgraph-centric programming model is a promising approach and has been applied in many state-of-the-art distributed graph computing frameworks. However, traditional graph part…