Publications related to Information Retrieval Under Network Uncertainty: Robust Internet Ranking

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016

Low Complexity Scheduling and Coding for Wireless Networks

Siddhartha Brahma

The advent of wireless communication technologies has created a paradigm shift in the accessibility of communication. With it has come an increased demand for throughput, a trend that is likely to increase further in the future. A key aspect of these chall ...

EPFL2015

Enforcing Efficient Equilibria in Network Design Games via Subsidies

Christos Kalaitzis

The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select among several alternatives which links to establish so that the resulting net ...

Springer Verlag2015

Structure of optimal schedules in diamond networks

Christina Fragouli, Siddhartha Brahma

We consider Gaussian diamond networks with n half-duplex relays. At any point of time, a relay can either be in a listening (L) or transmitting (T) state. The capacity of such networks can be approximated to within a constant gap (independent of channel SN ...

Ieee2014

Enforcing Topic Diversity in a Document Recommender for Conversations

Andrei Popescu-Belis, Maryam Habibi

This paper addresses the problem of building concise, diverse and relevant lists of documents, which can be recommended to the participants of a conversation to fulfill their information needs without distracting them. These lists are retrieved periodicall ...

2014

Is the Network Turing-Complete?

Dejan Kostic, Peter Peresini

Ensuring correct network behavior is hard. This is the case even for simple networks, and adding middleboxes only complicates this task. In this paper, we demonstrate a fundamental property of networks. Namely, we show a way of using a network to emulate t ...

2013

Reduced Models for Optimal Control, Shape Optimization and Inverse Problems in Haemodynamics

Andrea Manzoni

The objective of this thesis is to develop reduced models for the numerical solution of optimal control, shape optimization and inverse problems. In all these cases suitable functionals of state variables have to be minimized. State variables are solutions ...

EPFL2012

Locating the Source of Diffusion in Large-Scale Networks

Martin Vetterli, Patrick Thiran, Pedro Pereira Correia Pinto

How can we localize the source of diffusion in a complex network? Due to the tremendous size of many real networks---such as the Internet or the human social graph---it is usually infeasible to observe the state of all nodes in a network. We show that it i ...

American Physical Society2012

Strongly feasible stochastic model predictive control

Milan Korda

In this article we develop a systematic approach to enforce strong feasibility of probabilistically constrained stochastic model predictive control problems for linear discrete-time systems under affine disturbance feedback policies. Two approaches are pre ...

2011

Selection of Network Coding Nodes for Minimal Playback Delay in Streaming Overlays

Pascal Frossard, Nikolaos Thomos, Nicolae Cleju

Network coding permits to deploy distributed packet delivery algorithms that locally adapt to the network availability in media streaming applications. However, it may also increase delay and computational complexity if it is not implemented efficiently. W ...

2011

Information Retrieval Under Network Uncertainty: Robust Internet Ranking

Graph Chatbot

Chat with Graph Search

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Low Complexity Scheduling and Coding for Wireless Networks

Enforcing Efficient Equilibria in Network Design Games via Subsidies

Structure of optimal schedules in diamond networks

Enforcing Topic Diversity in a Document Recommender for Conversations

Is the Network Turing-Complete?

Reduced Models for Optimal Control, Shape Optimization and Inverse Problems in Haemodynamics

Locating the Source of Diffusion in Large-Scale Networks

Strongly feasible stochastic model predictive control

Selection of Network Coding Nodes for Minimal Playback Delay in Streaming Overlays

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Selection of Network Coding Nodes for Minimal Playback Delay in Streaming Overlays

Locating the Source of Diffusion in Large-Scale Networks

Reduced Models for Optimal Control, Shape Optimization and Inverse Problems in Haemodynamics

Low Complexity Scheduling and Coding for Wireless Networks

Strongly feasible stochastic model predictive control

Enforcing Topic Diversity in a Document Recommender for Conversations

Enforcing Efficient Equilibria in Network Design Games via Subsidies

Structure of optimal schedules in diamond networks

Is the Network Turing-Complete?