activity
20132026
most citedLimits on correlations in networks for quantum and no-signaling resources

73 citations · 276 across the 38 of their papers we have counts for

collaborators

43 papers

cs.DS2026

Two Holes Make a Difference: Deterministic Paging with Delay and Deadlines

Darya Melnyk, Linda Thelen, Yuyi Wang

In this paper, we study online paging with delay or deadlines. In online paging with delay, an online algorithm manages a cache of size and needs to serve incoming requests by…

math.CO2026

Constrained Multi-Relational Graphons with Maximum Entropy

Juan Alvarado, Jan Ramon, Yuyi Wang

The principle of maximum entropy provides a fundamental framework for characterizing typical structures of large random networks subject to observable constraints. In their pioneer…

cs.CG2026

MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem

Yi Zhou, Haocheng Fu, Yiping Liu +3

The two-dimensional irregular bin packing problem (2DIBPP) aims to pack a given set of irregular polygons, referred to as pieces, into fixed-size rectangular bins without overlap,…

cs.CV2023

AGTGAN: Unpaired Image Translation for Photographic Ancient Character Generation

Hongxiang Huang, Daihui Yang, Gang Dai +7

The study of ancient writings has great value for archaeology and philology. Essential forms of material are photographic characters, but manual photographic character recognition…

cs.LO2023★ 2 cited

On Discovering Interesting Combinatorial Integer Sequences

Martin Svatoš, Peter Jung, Jan Tóth +2

We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate firs…

cs.CV2022★ 2 cited

Complex Handwriting Trajectory Recovery: Evaluation Metrics and Algorithm

Zhounan Chen, Daihui Yang, Jinglin Liang +4

Many important tasks such as forensic signature verification, calligraphy synthesis, etc, rely on handwriting trajectory recovery of which, however, even an appropriate evaluation…

cs.DS2022

Efficient Submodular Optimization under Noise: Local Search is Robust

Lingxiao Huang, Yuyi Wang, Chunxue Yang +1

The problem of monotone submodular maximization has been studied extensively due to its wide range of applications. However, there are cases where one can only access the objective…

cs.LG2022

Continuous Temporal Graph Networks for Event-Based Graph Data

Jin Guo, Zhen Han, Zhou Su +3

There has been an increasing interest in modeling continuous-time dynamics of temporal graph data. Previous methods encode time-evolving relational information into a low-dimension…

cs.DS2022

Online Matching with Convex Delay Costs

Xingwu Liu, Zhida Pan, Yuyi Wang +1

We investigate the problem of Min-cost Perfect Matching with Delays (MPMD) in which requests are pairwise matched in an online fashion with the objective to minimize the sum of spa…

cs.DS2021

Online k-Way Matching with Delays and the H-Metric

Darya Melnyk, Yuyi Wang, Roger Wattenhofer

In this paper, we study -Way Min-cost Perfect Matching with Delays - the -MPMD problem. This problem considers a metric space with nodes. Requests arrive at these nodes i…

cs.SI2020★ 1 cited

Quadratic Optimization based Clique Expansion for Overlapping Community Detection

Yanhao Yang, Pan Shi, Yuyi Wang +1

Community detection is crucial for analyzing social and biological networks, and comprehensive approaches have been proposed in the last two decades. Nevertheless, finding all over…

quant-ph2020★ 5 cited

Space Complexity of Streaming Algorithms on Universal Quantum Computers

Yanglin Hu, Darya Melnyk, Yuyi Wang +1

Universal quantum computers are the only general purpose quantum computers known that can be implemented as of today. These computers consist of a classical memory component which…

cs.DS2020

Target Location Problem for Multi-commodity Flow

Xingwu Liu, Zhida Pan, Yuyi Wang

Motivated by scheduling in Geo-distributed data analysis, we propose a target location problem for multi-commodity flow (LoMuF for short). Given commodities to be sent from their r…

cs.LG2020★ 13 cited

Graph Hawkes Neural Network for Forecasting on Temporal Knowledge Graphs

Zhen Han, Yunpu Ma, Yuyi Wang +2

The Hawkes process has become a standard method for modeling self-exciting event sequences with different event types. A recent work has generalized the Hawkes process to a neurall…

cs.AI2020★ 1 cited

Domain-Liftability of Relational Marginal Polytopes

Ondrej Kuzelka, Yuyi Wang

We study computational aspects of relational marginal polytopes which are statistical relational learning counterparts of marginal polytopes, well-known from probabilistic graphica…

quant-ph2020★ 3 cited

Quantum Machine Learning Algorithm for Knowledge Graphs

Yunpu Ma, Volker Tresp

Semantic knowledge graphs are large-scale triple-oriented databases for knowledge representation and reasoning. Implicit knowledge can be inferred by modeling and reconstructing th…

cs.GT2019

Ride the Lightning: The Game Theory of Payment Channels

Zeta Avarikioti, Lioba Heimbach, Yuyi Wang +1

Payment channels were introduced to solve various eminent cryptocurrency scalability issues. Multiple payment channels build a network on top of a blockchain, the so-called layer 2…

cs.CL2019★ 5 cited

Improving Neural Relation Extraction with Positive and Unlabeled Learning

Zhengqiu He, Wenliang Chen, Yuyi Wang +3

We present a novel approach to improve the performance of distant supervision relation extraction with Positive and Unlabeled (PU) Learning. This approach first applies reinforceme…

cs.LG2019★ 8 cited

McDiarmid-Type Inequalities for Graph-Dependent Variables and Stability Bounds

Rui Ray Zhang, Xingwu Liu, Yuyi Wang +1

A crucial assumption in most statistical learning theory is that samples are independently and identically distributed (i.i.d.). However, for many real applications, the i.i.d. ass…

cs.DS2019

Online Payment Network Design

Georgia Avarikioti, Kenan Besic, Yuyi Wang +1

Payment channels allow transactions between participants of the blockchain to be executed securely off-chain, and thus provide a promising solution for the scalability problem of p…

cs.CR2019★ 6 cited

Bitcoin Security under Temporary Dishonest Majority

Georgia Avarikioti, Lukas Kaeppeli, Yuyi Wang +1

We prove Bitcoin is secure under temporary dishonest majority. We assume the adversary can corrupt a specific fraction of parties and also introduce crash failures, i.e., some hone…

cs.CC2019★ 6 cited

Query complexity of generalized Simon's problem

Zekun Ye, Yunqi Huang, Lvzhou Li +1

Simon's problem plays an important role in the history of quantum algorithms, as it inspired Shor to discover the celebrated quantum algorithm solving integer factorization in poly…

quant-ph2019

Variational Quantum Circuit Model for Knowledge Graphs Embedding

Yunpu Ma, Volker Tresp, Liming Zhao +1

In this work, we propose the first quantum Ansätze for the statistical relational learning on knowledge graphs using parametric quantum circuits. We introduce two types of variatio…

quant-ph2019★ 22 cited

Quantum speedup for twin support vector machines

Zekun Ye, Lvzhou Li, Haozhen Situ +1

We devise new quantum algorithms that exponentially speeds up the training and prediction procedures of twin support vector machines (TSVM). To train TSVMs using quantum methods, w…