The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
— This paper presents a cooperative relay strategy with a game-theoretic perspective. In multi-hop networks, each node needs to send traffic via relay nodes, which behave indepe...
This paper proposes a variation of synchronous grammar based on the formalism of context-free grammar by generalizing the first component of productions that models the source text...
Fai Wong, Dong-Cheng Hu, Yu-Hang Mao, Ming-Chui Do...
Given a set of 2D images, we propose a novel approach for the reconstruction of straight 3D line segments that represent the underlying geometry of static 3D objects in the scene....
Arjun Jain, Christian Kurz, Thorsten Thormaehlen, ...
In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks with precedence constraints are executed in a heterogeneous environment. It provi...