Publications related to Path (graph theory)

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

We present O(log log n)-round algorithms in the Massively Parallel Computation (MPC) model, with a(n) memory per machine, that compute a maximal independent set, a 1 + epsilon approximation of maximum matching, and a 2 + epsilon approximation of minimum ve ...

ASSOC COMPUTING MACHINERY2018

Coordination of Dynamic Software Components with JavaBIP

Simon Bliudze, Anastasia Mavridou

JavaBIP allows the coordination of software components by clearly separating the functional and coordination aspects of the system behavior. JavaBIP implements the principles of the BIP component framework rooted in rigorous operational semantics. Recent w ...

Springer International Publishing2017

Cliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function

Henry Markram, Kathryn Hess Bellwald, Michael Reimann, Rodrigo de Campos Perin, Giuseppe Chindemi, Martina Scolamiero, Ran Levi, Max Christian Nolte, Katharine Felicity Turner, Pawel Tadeusz Dlotko

The lack of a formal link between neural network structure and its emergent function has hampered our understanding of how the brain processes information. We have now come closer to describing such a link by taking the direction of synaptic transmission i ...

Frontiers Media Sa2017

Multi-level Logic Benchmarks: An Exactness Study

Giovanni De Micheli, Mathias Soeken, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù, Eleonora Testa, Winston Jason Haaswijk

In this paper, we study exact multi-level logic benchmarks. We refer to an exact logic benchmark, or exact benchmark in short, as the optimal implementation of a given Boolean function, in terms of minimum number of logic levels and/or nodes. Exact benchma ...

Ieee2017

Spinner: Scalable Graph Partitioning in the Cloud

Andreas Loukas, Dionysios Logothetis

In this paper, we present a graph partitioning algorithm to partition graphs with trillions of edges. To achieve such scale, our solution leverages the vertex-centric Pregel abstraction provided by Giraph, a system for large-scale graph analytics. We desig ...

Ieee2017

Spatial clustering for district heating integration in urban energy systems: application to geothermal energy

François Maréchal, Stéphane Joost, Stefano Moret, Jérémy Michel Pierre Unternährer

Given the challenges related to climate change and dependency from fossil fuels, modification of the energy systems infrastructure to increase the share of renewable energy is a priority in urban energy planning. The high heating density in cities makes it ...

2017

Diverse M-Best Solutions by Dynamic Programming

Michaël Unser, Virginie Sophie Uhlmann

Many computer vision pipelines involve dynamic programming primitives such as finding a shortest path or the minimum energy solution in a tree-shaped probabilistic graphical model. In such cases, extracting not merely the best, but the set of M-best soluti ...

Springer2017

Incremental Kinetic Modeling of Spectroscopic Data using a Reduced Calibration Model

Dominique Bonvin, Julien Léo Billeter

The identification of kinetic models is an important step for the monitoring, control and optimization of chemical processes. Kinetic models are often based on first principles that describe the evolution of concentrations by means of conservation and cons ...

2017

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.

Path (graph theory)

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

Analytical transport network theory to guide the design of 3-D microstructural networks in energy materials: Part 1. Flow without reactions

Coordination of Dynamic Software Components with JavaBIP

Cliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function

Multi-level Logic Benchmarks: An Exactness Study

Spinner: Scalable Graph Partitioning in the Cloud

Spatial clustering for district heating integration in urban energy systems: application to geothermal energy

Graph-based Methods for Visualization and Clustering

Diverse M-Best Solutions by Dynamic Programming

Incremental Kinetic Modeling of Spectroscopic Data using a Reduced Calibration Model

Graph Chatbot

Chat with Graph Search

Spinner: Scalable Graph Partitioning in the Cloud

Graph-based Methods for Visualization and Clustering

Analytical transport network theory to guide the design of 3-D microstructural networks in energy materials: Part 1. Flow without reactions

Diverse M-Best Solutions by Dynamic Programming

Coordination of Dynamic Software Components with JavaBIP

Spatial clustering for district heating integration in urban energy systems: application to geothermal energy

Incremental Kinetic Modeling of Spectroscopic Data using a Reduced Calibration Model

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

Cliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function

Multi-level Logic Benchmarks: An Exactness Study