Publication

Orthogeodesic Point-Set Embedding of Trees

Related publications (96)

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.

Semi-Automated Design of a MOS Current Mode Logic Standard Cell Library from Generic Components

Yusuf Leblebici, Stéphane Badel, Ilhan Hatirnaz

This paper describes the design and semi-automated generation of a MOS current-mode logic standard cell library. A set of generic components implementing a wide range of combinational and sequential functions is proposed. The layout of the generic componen ...

2005

A framework for component-based construction

Joseph Sifakis

We present an overview of results developed mainly at Verimag, by the author and his colleagues, on a framework for component-based construction, characterized by the following: the behavior of atomic components is represented by transition systems; compon ...

2005

Consensus with Unknown Participants or Fundamental Self-Organization

André Schiper, David Cavin, Yoav Sasson

We consider the problem of bootstrapping self-organized mobile ad hoc networks (MANET), i.e. reliably determining in a distributed and self- organized manner the services to be offered by each node when neither the identity nor the number of the nodes in t ...

2004

Are two Classifiers performing equally? A treatment using Bayesian Hypothesis Testing

We consider here how to assess if two classifiers, based on a set of test error results, are performing equally well. This question is often considered in the realm of sampling theory, based on classical hypothesis testing. Here we present a simple Bayesia ...

IDIAP2004

Secure Positioning in Sensor Networks

Jean-Pierre Hubaux, Srdan Capkun

So far, the problem of positioning in sensor and ad hoc networks has been studied in a non-adversarial setting. We show that most of the proposed positioning algorithms are highly vulnerable to attacks from compromised network nodes and malicious (outside) ...

2004

From Set Membership to Group Membership: A Separation of Concerns

André Schiper

We revisit the well-known group membership problem, and show how it can be considered a special case of a simpler problem, the set membership problem. In the set membership problem, processes maintain a set whose elements are drawn from an arbitrary univer ...

2003

Dielectric constants of Zr silicates: A first-principles study

Alfredo Pasquarello, Angelo Bongiorno

Using density-functional theory, we compute the optical and static dielectric constants for a set of Zr silicates modeled by various SiO2 crystals, with Zr atoms substitutional to Si, and by an amorphous structure. We then derive a microscopic scheme that ...

2002

Calibration of Spectral Reaction Data

Dominique Bonvin, Michael Amrhein

Calibration is the first step in the prediction of concentrations from spectral measurements of chemical reaction systems. It is a well-known fact that the species in the calibration set must include those in the new set. Typically, the calibration set is ...

1999

Sufficient conditions for the existence of Q-balls in gauge theories

1998

Hidden collisions on DSS

Serge Vaudenay

We explain how to forge public parameters for the Digital Signature Standard with two known messages which always produce the same set of valid signatures (what we call a collision). This attack is thwarted by using the generation algorithm suggested in th ...

1996