Publications related to Transitive closure

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.

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024

Between Hospitality and Inhospitality: The Janus-Faced 'Arrival Infrastructure'

Luca Giovanni Pattaroni, Maxime Carl Felder, Marie Hannah Florence Trossat, Joan Stavo-Debauge

Although 'arrival infrastructure' is central to the experience of migrants arriving in a new city, is it sufficient to form a 'hospitable milieu'? Our article compares newcomers' experiences with 'arrival infrastructure' in two European cities: Brussels an ...

2020

Between Hospitality and Inhospitality: The Janus-Faced 'Arrival Infrastructure'

Luca Giovanni Pattaroni, Guillaume Simon Joseph Drevon, Maxime Carl Felder, Marie Hannah Florence Trossat, Joan Stavo-Debauge

Although ‘arrival infrastructure’ is central to the experience of migrants arriving in a new city, is it sufficient to form a ‘hospitable milieu’? Our article compares newcomers’ experiences with ‘arrival infrastructure’ in two European cities: Brussels an ...

2020

RAQ: Relationship-Aware Graph Querying in Large Networks

Akhil Arora, Arnab Bhattacharya

The phenomenal growth of graph data from a wide variety of real-world applications has rendered graph querying to be a problem of paramount importance. Traditional techniques use structural as well as node similarities to find matches of a given query grap ...

ASSOC COMPUTING MACHINERY2019

MATHICSE Technical Report: Reduced basis methods: from low-rank matrices to low-rank tensor

Daniel Kressner, Jonas Ballani

We propose a novel combination of the reduced basis method with low-rank tensor techniques for the efficient solution of parameter-dependent linear systems in the case of several parameters. This combination, called rb Tensor, consists of three ingredients ...

MATHICSE2015

Resting-brain functional connectivity predicted by analytic measures of network communication

Jean-Philippe Thiran, Alessandra Griffa, Patric Hagmann, Olaf Sporns

6 The complex relationship between structural and functional connectivity, as measured by noninvasive imaging of the human brain, poses many unresolved challenges and open questions. Here, we apply analytic measures of network communication to the structur ...

Natl Acad Sciences2014

Online Energy-Efficient Task-Graph Scheduling for Multicore Platforms

David Atienza Alonso, Karim Kanoun

Numerous Directed-Acyclic Graph (DAG) schedulers have been developed to improve the energy efficiency of various multi-core platforms. However, these schedulers make a priori assumptions about the relationship between the task dependencies, and they are un ...

Institute of Electrical and Electronics Engineers2014

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024

Transitive closure

Graph Chatbot

Chat with Graph Search

Efficient Continual Finite-Sum Minimization

Between Hospitality and Inhospitality: The Janus-Faced 'Arrival Infrastructure'

Between Hospitality and Inhospitality: The Janus-Faced 'Arrival Infrastructure'

RAQ: Relationship-Aware Graph Querying in Large Networks

MATHICSE Technical Report: Reduced basis methods: from low-rank matrices to low-rank tensor

Resting-brain functional connectivity predicted by analytic measures of network communication

Online Energy-Efficient Task-Graph Scheduling for Multicore Platforms

On Accelerating Interpolants

Accelerating Interpolants

Closure of “Chute Aerators. II: Hydraulic Design"

Online Energy-Efficient Task-Graph Scheduling for Multicore Platforms

RAQ: Relationship-Aware Graph Querying in Large Networks

Efficient Continual Finite-Sum Minimization

Resting-brain functional connectivity predicted by analytic measures of network communication

Between Hospitality and Inhospitality: The Janus-Faced 'Arrival Infrastructure'

Between Hospitality and Inhospitality: The Janus-Faced 'Arrival Infrastructure'

MATHICSE Technical Report: Reduced basis methods: from low-rank matrices to low-rank tensor

On Accelerating Interpolants

Closure of “Chute Aerators. II: Hydraulic Design"

Accelerating Interpolants