Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Rooted graph

Publications associées (28)

View Selection Policy For Multi-View Video Delivery

We derive an optimization framework for computing a view selection policy for streaming multi-view content over a bandwidth constrained channel. The optimization allows us to determine the decisions of sending the packetized data such that the end-to-end r ...

IEEE2013

Clustering with Multi-Layer Graphs: A Spectral Perspective

Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong

Observational data usually comes with a multimodal nature, which means that it can be naturally represented by a multi-layer graph whose layers share the same set of vertices (users) with different edges (pairwise relationships). In this paper, we address ...

Institute of Electrical and Electronics Engineers2012

Cohomology of GKM fiber bundles

Silvia Sabatini

The equivariant cohomology ring of a GKM manifold is isomorphic to the cohomology ring of its GKM graph. In this paper we explore the implications of this fact for equivariant fiber bundles for which the total space and the base space are both GKM and deri ...

Springer Verlag2012

The impact of mobility on the time complexity for deterministic broadcasting in radio networks

André Schiper, David Cavin, Yoav Sasson

We study the time complexity for deterministic broadcasting algorithms in mobile radio networks. The broadcast operation consists of a source node successfully communicating its message to every other node. In multi-hop radio networks such as MANETs, the m ...

2011

Interval propagation and search on directed acyclic graphs for numerical constraint solving

Xuan-Ha Vu

The fundamentals of interval analysis on directed acyclic graphs (DAGs) for global optimization and constraint propagation have recently been proposed in Schichl and Neumaier (J. Global Optim. 33, 541-562, 2005). For representing numerical problems, the au ...

Springer US2009

Asymmetric information embedding

Mohammad Amin Shokrollahi

In the Information Embedding Problem one is given a piece of data which can be altered only conditionally, for example only at certain places. One is then asked to embed an arbitrary message into the data by only applying admissible changes to the data. Th ...

Springer-Verlag2008

On Broadcast with a Common Message over Networks

We consider the following communication problem over a directed graph. A source node wants to transmit a common message to a set of receiver nodes along with a private message to each of the receivers. We show a class of networks for which the achievable r ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Loss Tomography in General Topologies with Network Coding

Christina Fragouli

Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general topologies typically use a mesh of multicast trees and/or unicast paths to cover the en ...

2007

Publications associées (28)