Publications related to A Unified Experiment Design Approach for Cyclic and Acyclic Causal Models

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.

Empirical Modeling of a Squeeze Film Haptic Actuator

Yves Perriard, Miroslav Markovic, Christophe Winter

In the analysis of squeeze film haptic tactile feedback actuators, attention is focused on establishing an empirical model of the force generated on the user's finger. The model is based on finite-element simulations which take into account the real motion ...

Institute of Electrical and Electronics Engineers2014

Fabrication-aware Design with Intersecting Planar Pieces

Mark Pauly, Yuliy Gennadievich Schwartzburg

We propose a computational design approach to generate 3D models composed of interlocking planar pieces. We show how intricate 3D forms can be created by sliding the pieces into each other along straight slits, leading to a simple construction that does no ...

Blackwell Publishing2013

Lower bounds on the obstacle number of graphs

János Pach, Doemoetoer Palvoelgyi, Padmini Mukkamala

Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices of G are joined by an edge if and only if the corresponding points can be con ...

2012

Graph Transformations preserving the stability number

Dominique de Werra

We analyze the relations between several graph transformations that were introduced to be used in procedures determining the stability number of a graph. We show that all these transformations can be decomposed into a sequence of edge deletions and twin de ...

Elsevier Science Bv2012

Clustering with Multi-Layer Graphs: A Spectral Perspective

Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong

Observational data usually comes with a multimodal nature, which means that it can be naturally represented by a multi-layer graph whose layers share the same set of vertices (users) with different edges (pairwise relationships). In this paper, we address ...

Institute of Electrical and Electronics Engineers2012

Methods for Clustering Multi-Layer Graphs in Mobile Networks

Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong

Clustering on graphs has been studied extensively for years due to its numerous applications. However, in contrast to the classic problems, clustering in mobile and online social networks brings new challenges. In these scenarios, it is common that observa ...

2011

Adjacent Crossings Do Matter

Radoslav Fulek

In a drawing of a graph, two edges form an odd pair if they cross each other an odd number of times. A pair of edges is independent if they share no endpoint. For a graph G, let ocr(G) be the smallest number of odd pairs in a drawing of G and let iocr(G) b ...

Springer-Verlag Berlin2011

Graphs that Admit Right Angle Crossing Drawings

Radoslav Fulek, Balázs Keszegh, Filip Moric

We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a graph with n vertices admits a RAC drawing with at most 1 bend or 2 bends pe ...

2010

A Unified Experiment Design Approach for Cyclic and Acyclic Causal Models

Graph Chatbot

Chat with Graph Search

Empirical Modeling of a Squeeze Film Haptic Actuator

THE NUMBER OF EDGES IN k-QUASI-PLANAR GRAPHS

Fabrication-aware Design with Intersecting Planar Pieces

Graphs That Admit Polyline Drawings with Few Crossing Angles

Lower bounds on the obstacle number of graphs

Graph Transformations preserving the stability number

Clustering with Multi-Layer Graphs: A Spectral Perspective

Methods for Clustering Multi-Layer Graphs in Mobile Networks

Adjacent Crossings Do Matter

Graphs that Admit Right Angle Crossing Drawings

THE NUMBER OF EDGES IN k-QUASI-PLANAR GRAPHS

Graphs That Admit Polyline Drawings with Few Crossing Angles

Fabrication-aware Design with Intersecting Planar Pieces

Clustering with Multi-Layer Graphs: A Spectral Perspective

Lower bounds on the obstacle number of graphs

Graph Transformations preserving the stability number

Graphs that Admit Right Angle Crossing Drawings

Empirical Modeling of a Squeeze Film Haptic Actuator

Adjacent Crossings Do Matter

Methods for Clustering Multi-Layer Graphs in Mobile Networks