Publications associées à Pont (réseau)

Essays in Empirical Asset Pricing

This thesis consists of three applications of machine learning techniques to empirical asset pricing. In the first part, which is co-authored work with Oksana Bashchenko, we develop a new method that detects jumps nonparametrically in financial time series ...

EPFL2022

Penalized denoising of vehicle trajectories collected by a swarm of drones

Nikolaos Geroliminis, Emmanouil Barmpounakis, Georgios Anagnostopoulos

Vehicle trajectory datasets collected in urban traffic environments with drones pose unique chal- lenges in terms of denoising due to extensive visual restrictions, perspective distortions and human- induced errors. This article taps into the unexplored po ...

2022

GarNet++: Improving Fast and Accurate Static 3D Cloth Draping by Curvature Loss

Pascal Fua, Mathieu Salzmann, Victor Constantin, Shaifali Parashar, Erhan Gündogdu

In this paper, we tackle the problem of static 3D cloth draping on virtual human bodies. We introduce a two-stream deep network model that produces a visually plausible draping of a template cloth on virtual 3D bodies by extracting features from both the b ...

2022

Verifying Software Network Functions with No Verification Expertise

George Candea, Solal Vincenzo Pirelli, Rishabh Ramesh Iyer, Aikaterini Argyraki, Luis David Figueiredo Mascarenhas Moreira Pedrosa, Matteo Rizzo

We present the design and implementation of Vigor, a software stack and toolchain for building and running software network middleboxes that are guaranteed to be correct, while preserving competitive performance and developer productivity. Developers write ...

ACM2019

Employing Attack Graphs for Intrusion Detection

Mathias Josef Payer

Intrusion detection systems are a commonly deployed defense that examines network traffic, host operations, or both to detect attacks. However, more attacks bypass IDS defenses each year, and with the sophistication of attacks increasing as well, we must e ...

ASSOC COMPUTING MACHINERY2019

Wireless Network Simplification: The Gaussian N-Relay Diamond Network

Christina Fragouli

We consider the Gaussian N-relay diamond network, where a source wants to communicate to destination node through a layer of N-relay nodes. We investigate the following question: what fraction of the capacity can we maintain using only k out of the N avail ...

Institute of Electrical and Electronics Engineers2014

Triangle Network Secrecy

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We characterize the secret message capacity of the triangle network, that consists of a source, a relay and a destination connected through orthogonal erasure channels. A passive eavesdropper, Eve, wiretaps any one of the three channels. The source and the ...

2014

Estimating MFDs in simple networks with route choice

Nikolaos Geroliminis

The concept of the Macroscopic Fundamental Diagram (MFD) is elegant and attractive because it provides a global view of traffic behavior and performance at a network level. However, recent research shows that the MFD shape can be influenced by local traffi ...

Elsevier2013

Network Coding : Theoretical Designs Directed to Applications

Mahdi Jafari Siavoshani

The demand for higher throughput and better efficiency are two important challenges for future communication networks. During the past decades, a lot of research studies have been devoted to investigating and proposing near optimal and efficient schemes an ...

EPFL2012

On Two Unicast Wireless Networks with Destination-to-Source Feedback

I-Hsiang Wang

In this paper we study the role of feedback in layered two unicast wireless networks with arbitrary number of nodes and connectivity. The feedback model allows destinations to feedback their received signals to their respective sources. In the case of line ...

Ieee2012

Valuable Detours: Least-Cost Anypath Routing

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. This observation was previously exploited by opportunistic routing protocols by using single-path routing metrics to assign to each no ...

2011

NC Node Selection Game in Collaborative Streaming Systems

Pascal Frossard, Nikolaos Thomos, Eymen Kurdoglu

Network coding has been recently proposed as an efficient method to improve throughput, minimize delays and remove the need for reconciliation between network nodes in distributed streaming systems. It permits to take advantage of the path and node diversi ...

2010

Verifiable Network-Performance Measurements

Aikaterini Argyraki

In the current Internet, there is no clean way for affected parties to react to poor forwarding performance: to detect and assess Service Level Agreement (SLA) violations by a contractual partner, a domain must resort to ad-hoc monitoring using probes. Ins ...

2010

Circulation of Autonomous Agents in Production and Service Networks

Max-Olivier Hongler, Olivier Gallay

The inherent complexity characterizing the production and/or service networks strongly favors decentralized and self-organizing mechanisms to regulate the flows of matter and information in circulation. This basic observation motivates us to study the flow ...

Elsevier2009

Distributed rate allocation for multi-flow video delivery

We consider rate-distortion (RD) optimized multi-flow video delivery in unstructured overlay networks. We show that this problem can be studied as a distributed rate allocation. To solve the problem over the participating peers in the overlay, we apply cla ...

2009

Localized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks

François Ingelrest

We present a minimum spanning tree based energy aware multicast protocol (MSTEAM), which is a localized geographic multicast routing scheme designed for ad hoc and sensor networks. It uses locally-built minimum spanning trees (MST) as an efficient approxim ...

2008