Publications associées à Algorithme de Borůvka

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Jan Sickmann Hesthaven, Benjamin Stamm

We propose two new and enhanced algorithms for greedy sampling of high- dimensional functions. While the techniques have a substantial degree of generality, we frame the discussion in the context of methods for empirical interpolation and the devel- opment ...

EDP Sciences2014

Scale-up Graph Processing in the Cloud: Challenges and Solutions

Willy Zwaenepoel, Amitabha Roy, Jasmina Malicevic

Processing large graphs is an important part of the big-data problem. Recently a number of scale-up systems such as X-Stream, Graphchi and Turbograph have been proposed for processing large graphs using secondary storage on a single machine. The design and ...

SCOOP: A Real-Time Sparsity Driven People Localization Algorithm

Pierre Vandergheynst, Alexandre Massoud Alahi, Mohammad Golbabaee

Detecting and tracking people in scenes monitored by cameras is an important step in many application scenarios such as surveillance, urban planning or behavioral studies to name a few. The amount of data produced by camera feeds is so large that it is als ...

Springer Verlag2012

Coloring fuzzy circular interval graphs

Friedrich Eisenbrand, Martin Niemeier

Given a graph G with nonnegative node labels w, a multiset of stable sets S_1,...,S_k\subseteq V(G) such that each vertex v \in V(G) is contained in w(v) many of these stable sets is called a weighted coloring. The weighted coloring number \chi_w(G) is the ...

Elsevier2012

Thick Boundaries in Binary Space and Their Influence on Nearest-Neighbor Search

Pascal Fua, Vincent Lepetit, Tomasz Piotr Trzcinski

Binary descriptors allow faster similarity computation than real-valued ones while requiring much less storage. As a result, many algorithms have recently been proposed to binarize ﬂoating-point descriptors so that they can be searched for quickly. Unfortu ...

Elsevier2012

Multi-Target Tracking Of Packed Yeast Cells

Michaël Unser, Sebastian Maerkl, Ricard Delgado Gonzalo, Nicolas Dénervaud

The tracking of cell populations in time-lapse microscopy images enables high-throughput spatiotemporal measurements of cell dynamics. In this paper, we present a new algorithm to simultaneously track many cells in crowded areas. The algorithm runs in real ...

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

Multi-Target Tracking of Packed Yeast Cells

Michaël Unser, Ricard Delgado Gonzalo

IEEE2010

Sorting signed permutations by inversions in O(nlogn) time

Bernard Moret, Yu Lin, Vaibhav Rajan, Krister Swenson

The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inv ...

2010

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Algorithme de Borůvka

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Scale-up Graph Processing in the Cloud: Challenges and Solutions

SCOOP: A Real-Time Sparsity Driven People Localization Algorithm

Coloring fuzzy circular interval graphs

Thick Boundaries in Binary Space and Their Influence on Nearest-Neighbor Search

Finding Objects of Interest in Images using Saliency and Superpixels

Recursive Implementation of the Distributed Karhunen-Loeve Transform

Multi-Target Tracking Of Packed Yeast Cells

Multi-Target Tracking of Packed Yeast Cells

Sorting signed permutations by inversions in O(nlogn) time

Graph Chatbot

Chattez avec Graph Search

Scale-up Graph Processing in the Cloud: Challenges and Solutions

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

SCOOP: A Real-Time Sparsity Driven People Localization Algorithm

Coloring fuzzy circular interval graphs

Finding Objects of Interest in Images using Saliency and Superpixels

Recursive Implementation of the Distributed Karhunen-Loeve Transform

Thick Boundaries in Binary Space and Their Influence on Nearest-Neighbor Search

Multi-Target Tracking of Packed Yeast Cells

Multi-Target Tracking Of Packed Yeast Cells

Sorting signed permutations by inversions in O(nlogn) time