Concept

Reachability

Related publications (13)

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.

Aerosol absorption over the Aegean Sea under northern summer winds

Athanasios Nenes

In this modelling study, the absorption influence on radiation, apart from scattering, is studied above the Aegean Sea (Eastern Mediterranean) under a typical warm 13-day period with northern winds, transporting polluted air masses. The simulated (WRF-Chem ...

2020

Reconciling Factor Graph with User Feedback

Thành Tâm Nguyên

Factor graph is a representative graphical model to handle uncertainty of random variables. Factor graph has been used in various application domains such as named entity recognition, social network analysis, and credibility evaluation. In this paper, we s ...

2015

Localizing Polygonal Objects in Man-Made Environments

Xiaolu Sun

Object detection is a significant challenge in Computer Vision and has received a lot of attention in the field. One such challenge addressed in this thesis is the detection of polygonal objects, which are prevalent in man-made environments. Shape analysis ...

EPFL2015

Exponentiality of the exchange algorithm for finding another room-partitioning

Laura Sanità

Let T be a triangulated surface given by the list of vertex-triples of its triangles, called rooms. A room-partitioning for T is a subset R of the rooms such that each vertex of T is in exactly one room in R. Given a room-partitioning R for T, the exchange ...

Elsevier Science Bv2014

Exploring Spatial Characteristics of Urban Transportation Networks

Nikolaos Geroliminis, Yuxuan Ji

It has been shown recently that a Macroscopic Fundamental Diagram (MFD) exists in urban transportation networks under certain conditions. However, MFD is not universally expected. Previous research demonstrates the existence of MFDs in homogeneous networks ...

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

Compositional verification for component-based systems and application

Joseph Sifakis

The authors present a compositional method for the verification of component-based systems described in a subset of the behaviour-interaction- priority language encompassing multi-party interaction without data transfer. The method is based on the use of t ...

2010

Compositional verification for component-based systems and application

Joseph Sifakis

We present a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transfer. The method is based on the use of two kinds of invariants. Component inv ...

2008

Linear Arithmetic with Stars

Viktor Kuncak, Ruzica Piskac

We consider an extension of integer linear arithmetic with a “star” operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We show that the satisfiability problem for this extended language remains in NP (and th ...

Springer2008

On Linear Arithmetic with Stars

Viktor Kuncak, Ruzica Piskac

We consider an extension of integer linear arithmetic with a star operator that takes closure under vector addition of the set of solutions of linear arithmetic subformula. We show that the satisfiability problem for this language is in NP (and therefore N ...

2008

Computing Vertex Connectivity: New Bounds from Old Techniques

Monika Henzinger

The vertex connectivity K of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. We present the fastest known deterministic algorithm for finding the vertex connectivity and a corresponding separator. The time ...

2000