Person

Maciej Kurant

This person is no longer with EPFL

Related publications (12)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Towards Unbiased BFS Sampling

Patrick Thiran, Maciej Kurant

Breadth First Search (BFS) is a widely used approach for sampling large graphs. However, it has been empirically observed that BFS sampling is biased toward high-degree nodes, which may strongly affect the measurement results. In this paper, we quantify an ...

Institute of Electrical and Electronics Engineers2011

Exploiting the Path Propagation Time Differences in Multipath Transmission with FEC

Maciej Kurant

We consider a transmission of a delay-sensitive data stream (e. g., a video call) from a single source to a single destination. The reliability of this transmission may suffer from bursty packet losses - the predominant type of failures in today's Internet ...

2011

Netscope: Practical Network Loss Tomography

Patrick Thiran, Xuan Hung Nguyen, Maciej Kurant, Denisa Gabriela Ghita

We present Netscope, a tomographic technique that infers the loss rates of network links from unicast end-to-end measurements. Netscope uses a novel combination of first- and second-order moments of end-to-end measurements to identify and characterize the ...

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

Robustness to failures in two-layer communication networks

Maciej Kurant

A close look at many existing systems reveals their two- or multi-layer nature, where a number of coexisting networks interact and depend on each other. For instance, in the Internet, any application-level graph (such as a peer-to-peer network) is mapped o ...

EPFL2009

Estimating the Confidence Level of White Matter Connections Obtained with MRI Tractography

Jean-Philippe Thiran, Reto Meuli, Patric Hagmann, Leila Cammoun, Xavier Gigandet, Maciej Kurant

Background Since the emergence of diffusion tensor imaging, a lot of work has been done to better understand the properties of diffusion MRI tractography. However, the validation of the reconstructed fiber connections remains problematic in many respects. ...

2008

Mapping Human Whole-Brain Structural Networks with Diffusion MRI

Jean-Philippe Thiran, Patrick Thiran, Reto Meuli, Patric Hagmann, Xavier Gigandet, Maciej Kurant, Van Jay Wedeen

Understanding the large-scale structural network formed by neurons is a major challenge in system neuroscience. A detailed connectivity map covering the entire brain would therefore be of great value. Based on diffusion MRI, we propose an efficient methodo ...

2007

Error and Attack Tolerance of Layered Complex Networks

Patrick Thiran, Patric Hagmann, Maciej Kurant

Many complex systems may be described by not one but a number of complex networks mapped on each other in a multi-layer structure. Because of the interactions and dependencies between these layers, the state of a single layer does not necessarily reflect w ...

2007

Survivable Routing of Mesh Topologies in IP-over-WDM Networks by Recursive Graph Contraction

Patrick Thiran, Maciej Kurant

Failure restoration at the IP layer in IP-over-WDM networks requires to map the IP topology on the WDM topology in such a way that a failure at the WDM layer leaves the IP topology connected. Such a mapping is called survivable. Finding a survivable mappin ...

2007

The knowledge of real-life traffic patterns is crucial for a good understanding and analysis of transportation systems. These data are quite rare. In this paper we propose an algorithm for extracting both the real physical topology and the network of traff ...

2006

Layered Complex Networks

Patrick Thiran, Maciej Kurant

Many complex networks are only a part of larger systems, where a number of coexisting topologies interact and depend on each other. We introduce a layered model to facilitate the description and analysis of such systems. As an example of its application, w ...

2006