Publication

The Role of Adaptivity in Source Identification with Time Queries

Related publications (36)

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.

Estimating small-world topology of neural networks from multi-electrode recordings

Wulfram Gerstner, Joao Emanuel Felipe Gerhard

Since the seminal work of Watts in the late 90s, graph-theoretic analyses have been performed on many complex dynamic networks, including brain structures. Most studies have focused on functional connectivity defined between whole brain regions, using imag ...

2011

Estimation of small-world topology of cortical networks using Generalized Linear Models

Wulfram Gerstner, Joao Emanuel Felipe Gerhard

Since the seminal work of Watts & Strogatz and others in the late 90s [1], graph-theoretic analyses have been performed on many complex dynamic networks, including brain structures. Most studies have focused on functional connectivity defined between whole ...

2011

Vector Network Coding

Christina Fragouli, Javad Ebrahimi Boroojeni

We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying th ...

2010

Vector Network Coding Algorithms

Christina Fragouli, Javad Ebrahimi Boroojeni

2010

A Weighting Scheme for Enhancing Community Detection in Networks

Martin Hasler, Alireza Khadivi

Many algorithms have recently been proposed for finding communities in networks. By definition, a community is a subset of vertices with a high number of connections among the vertices, but only few connections with other vertices. The worst drawback of mo ...

IEEE2010

Routing and search on large scale networks

Dominique Florian Tschopp

In this thesis, we address two seemingly unrelated problems, namely routing in large wireless ad hoc networks and comparison based search in image databases. However, the underlying problem is in essence similar and we can use the same strategy to attack t ...

EPFL2010

Characterizing Path Graphs by Forbidden Induced Subgraphs

A path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are mini ...

2009

Temporally Consistent Layer Depth Ordering Via Pixel Voting For Pseudo 3D Representation

Engin Türetken

A new region-based depth ordering algorithm is proposed based on the segmented motion layers with affine motion models. Starting from an initial set of layers that are independently extracted for each frame of an input sequence, relative depth order of eve ...

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

A note on the data-driven capacity of P2P networks

Pascal Frossard

We consider two capacity problems in P2P networks. In the first one, the nodes have an infinite amount of data to send and the goal is to optimally allocate their uplink bandwidths such that the demands of every peer in terms of receiving data rate are met ...

2009

Adaptive media streaming over multipath networks

Dan Jurca

With the latest developments in video coding technology and fast deployment of end-user broadband internet connections, real-time media applications become increasingly interesting for both private users and businesses. However, the internet remains a best ...

EPFL2007