Publications related to Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Generalized Hypertree Decompositions: NP-hardness and Tractable Variants

The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergraphs have bounded GHW are known to be solvable in polynomial time. However, i ...

2009

Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability

A binary tanglegram is a pair (S, T) of binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example in phylogenetics, it is essential that both trees are drawn without edge ...

Springer2009

Distributed Rate Allocation for Network-coded Systems

Christina Fragouli, Amin Jafarian

This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multic ...

2009

Distributed rate allocation for network-coded systems

Christina Fragouli, Amin Jafarian

This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multic ...

2009

A branch and bound algorithm for disassembly scheduling with assembly product structure⋆

Paul Xirouchakis, Hwa-Joong Kim

This paper considers a production planning problem in disassembly systems, which is the problem of determining the quantity and timing of disassembling end-of-use/life products in order to satisfy the demand of their parts or components over a planning hor ...

2009

Maximum independent sets of commuting and noninterfering inversions

Bernard Moret, Krister Swenson

Background: Given three signed permutations, an inversion median is a fourth permutation that minimizes the sum of the pairwise inversion distances between it and the three others. This problem is NP-hard as well as hard to approximate. Yet median-based ap ...

2009

Polynomial Filtering for Fast Convergence in Distributed Consensus

Pascal Frossard, Effrosyni Kokiopoulou

In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods proposed in the literature address the consensus averaging problem by distributed linear iter ...

2009

AN OPERATOR FORMULATION OF THE MULTISCALE FINITE-VOLUME METHOD WITH CORRECTION FUNCTION

Ivan Lunati

The multiscale finite-volume (MSFV) method has been derived to efficiently solve large problems with spatially varying coefficients. The fine-scale problem is subdivided into local problems that can be solved separately and are coupled by a global problem. ...

2009

Towards a Theory of Robust Localization against Malicious Beacon Nodes

Murtuza Jadliwala

Localization in the presence of malicious beacon nodes is an important problem in wireless networks. Although significant progress has been made on this problem, some fundamental theoretical questions still remain unanswered: in the presence of malicious b ...

IEEE Computer Society2008

Parametric integer programming in fixed dimension

Friedrich Eisenbrand, Gennady Shmonin

We consider the following problem: Given a rational matrix

A \in \mathbb{Q}^{m \times n}

and a rational polyhedron

Q \subseteq \mathbb{R}^{m+p}

, decide if for all vectors

b \in \mathbb{R}^m

, for which there exists an integral

z \in \mathbb{Z}^p

suc ...

2008

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Graph Chatbot

Chat with Graph Search

Generalized Hypertree Decompositions: NP-hardness and Tractable Variants

Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability

Distributed Rate Allocation for Network-coded Systems

Distributed rate allocation for network-coded systems

A branch and bound algorithm for disassembly scheduling with assembly product structure⋆

Maximum independent sets of commuting and noninterfering inversions

Polynomial Filtering for Fast Convergence in Distributed Consensus

AN OPERATOR FORMULATION OF THE MULTISCALE FINITE-VOLUME METHOD WITH CORRECTION FUNCTION

Towards a Theory of Robust Localization against Malicious Beacon Nodes

Parametric integer programming in fixed dimension

Maximum independent sets of commuting and noninterfering inversions

Polynomial Filtering for Fast Convergence in Distributed Consensus

Distributed rate allocation for network-coded systems

AN OPERATOR FORMULATION OF THE MULTISCALE FINITE-VOLUME METHOD WITH CORRECTION FUNCTION

Parametric integer programming in fixed dimension

Generalized Hypertree Decompositions: NP-hardness and Tractable Variants

Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability

A branch and bound algorithm for disassembly scheduling with assembly product structure⋆

Towards a Theory of Robust Localization against Malicious Beacon Nodes

Distributed Rate Allocation for Network-coded Systems