Search Results - "Cairo, Massimo"

Analysis of the Impact of Interpolation Methods of Missing RR-intervals Caused by Motion Artifacts on HRV Features Estimations by Morelli, Davide, Rossi, Alessio, Cairo, Massimo, Clifton, David A

“…Wearable physiological monitors have become increasingly popular, often worn during people's daily life, collecting data 24 hours a day, 7 days a week. In the…”
Get full text

Measuring Interoception: The CARdiac Elevation Detection Task by Ponzo, Sonia, Morelli, Davide, Suksasilp, Chatrin, Cairo, Massimo, Plans, David

“…Interoception has increasingly been the focus of psychiatric research, due to its hypothesized role in mental health. Existing interoceptive tasks either…”
Get full text

Safety in s-t Paths, Trails and Walks by Cairo, Massimo, Khan, Shahbaz, Rizzi, Romeo, Schmidt, Sebastian, Tomescu, Alexandru I.

“…Given a directed graph G and a pair of nodes s and t , an s - t bridge of G is an edge whose removal breaks all s - t paths of G (and thus appears in all s - t…”
Get full text

SDNN24 Estimation from Semi-Continuous HR Measures by Morelli, Davide, Rossi, Alessio, Bartoloni, Leonardo, Cairo, Massimo, Clifton, David A

“…The standard deviation of the interval between QRS complexes recorded over 24 h (SDNN24) is an important metric of cardiovascular health. Wrist-worn fitness…”
Get full text

Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete by Cairo, Massimo, Rizzi, Romeo

“…Even after the proposal of various solution algorithms, the precise computational complexity of checking whether a Conditional Temporal Network is Dynamically…”
Get full text

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG by Caceres, Manuel, Mumey, Brendan, Husic, Edin, Rizzi, Romeo, Cairo, Massimo, Sahlin, Kristoffer, Tomescu, Alexandru I.

“…A multi-assembly problem asks to reconstruct multiple genomic sequences from mixed reads sequenced from all of them. Standard formulations of such problems…”
Get full text

A simplified algorithm computing all s-t bridges and articulation points by Cairo, Massimo, Khan, Shahbaz, Rizzi, Romeo, Schmidt, Sebastian, Tomescu, Alexandru I., Zirondelli, Elia C.

“…Given a directed graph G and a pair of nodes s and t, an s-tbridge of G is an edge whose removal breaks all s-t paths of G. Similarly, an s-tarticulation point…”
Get full text

Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics by Rizzi, Romeo, Cairo, Massimo, Makinen, Veli, Tomescu, Alexandru I., Valenzuela, Daniel

“…Covering alignment problems arise from recent developments in genomics; so called pan-genome graphs are replacing reference genomes, and advances in…”
Get full text

Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks by Cairo, Massimo, Comin, Carlo, Rizzi, Romeo

“…Conditional Simple Temporal Network CSTN is a constraint-based graph-formalism for conditional temporal planning. Three notions of consistency arise for CSTNs…”
Get full text

Dynamic Controllability of Conditional Simple Temporal Networks is PSPACE-complete by Cairo, Massimo, Rizzi, Romeo

“…Even after the proposal of various solution algorithms, the precise computational complexity of checking whether a Conditional Temporal Network is Dynamically…”
Get full text

The Complexity of Simulation and Matrix Multiplication by Cairo, Massimo, Rizzi, Romeo

“…Computing the simulation preorder of a given Kripke structure (i.e., a directed graph with $n$ labeled vertices) has crucial applications in model checking of…”
Get full text

Minimum Path Cover in Parameterized Linear Time by Caceres, Manuel, Cairo, Massimo, Mumey, Brendan, Rizzi, Romeo, Tomescu, Alexandru I

“…A minimum path cover (MPC) of a directed acyclic graph (DAG) $G = (V,E)$ is a minimum-size set of paths that together cover all the vertices of the DAG…”
Get full text

Cut paths and their remainder structure, with applications by Cairo, Massimo, Khan, Shahbaz, Rizzi, Romeo, Schmidt, Sebastian, Tomescu, Alexandru I, Zirondelli, Elia C

“…In a strongly connected graph $G = (V,E)$, a cut arc (also called strong bridge) is an arc $e \in E$ whose removal makes the graph no longer strongly…”
Get full text

Genome assembly, from practice to theory: safe, complete and linear-time by Cairo, Massimo, Rizzi, Romeo, Tomescu, Alexandru I, Zirondelli, Elia C

“…Genome assembly asks to reconstruct an unknown string from many shorter substrings of it. Even though it is one of the key problems in Bioinformatics, it is…”
Get full text

Width Helps and Hinders Splitting Flows by Cáceres, Manuel, Cairo, Massimo, Grigorjew, Andreas, Khan, Shahbaz, Mumey, Brendan, Rizzi, Romeo, Tomescu, Alexandru I, Williams, Lucia

“…Minimum flow decomposition (MFD) is the NP-hard problem of finding a smallest decomposition of a network flow/circulation $X$ on a directed graph $G$ into…”
Get full text

Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time by Cáceres, Manuel, Cairo, Massimo, Mumey, Brendan, Rizzi, Romeo, Tomescu, Alexandru I

“…A minimum path cover (MPC) of a directed acyclic graph (DAG) $G = (V,E)$ is a minimum-size set of paths that together cover all the vertices of the DAG…”
Get full text

The Hydrostructure: a Universal Framework for Safe and Complete Algorithms for Genome Assembly by Cairo, Massimo, Khan, Shahbaz, Rizzi, Romeo, Schmidt, Sebastian, Tomescu, Alexandru I, Zirondelli, Elia C

“…Genome assembly is a fundamental problem in Bioinformatics, requiring to reconstruct a source genome from an assembly graph built from a set of reads (short…”
Get full text

A linear-time parameterized algorithm for computing the width of a DAG by Cáceres, Manuel, Cairo, Massimo, Mumey, Brendan, Rizzi, Romeo, Tomescu, Alexandru I

“…The width $k$ of a directed acyclic graph (DAG) $G = (V, E)$ equals the largest number of pairwise non-reachable vertices. Computing the width dates back to…”
Get full text

Safety in $s$-$t$ Paths, Trails and Walks by Cairo, Massimo, Khan, Shahbaz, Rizzi, Romeo, Schmidt, Sebastian, Tomescu, Alexandru I

“…Given a directed graph $G$ and a pair of nodes $s$ and $t$, an \emph{$s$-$t$ bridge} of $G$ is an edge whose removal breaks all $s$-$t$ paths of $G$ (and thus…”
Get full text

Computing all $s$-$t$ bridges and articulation points simplified by Cairo, Massimo, Khan, Shahbaz, Rizzi, Romeo, Schmidt, Sebastian, Tomescu, Alexandru I, Zirondelli, Elia

“…Given a directed graph $G$ and a pair of nodes $s$ and $t$, an $s$-$t$ bridge of $G$ is an edge whose removal breaks all $s$-$t$ paths of $G$. Similarly, an…”
Get full text