Concept

Liste de corps d'état

Publications associées (238)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

IFS-Modeling for Feasible Freeform Timber Constructions

Yves Weinand, Ivo Stotz, Gilles Gouaty

Within the last years, architectural design has shown great interest in the design of new and complex geometries, commonly known as 'free-form' architecture. The lack of constructive feasibility of the designed architectural objects led us to consider disc ...

2008

Annihilating polynomials of excellent quadratic forms

If phi is an excellent form, then it is possible to use the dimensions of the higher complements of phi to obtain an annihilating polynomial of phi of low degree. The main result of this paper is the construction of such a polynomial with the help of metho ...

Birkhäuser-Verlag, Springer2008

Evaluation of Camera Calibration Approaches for Video Image Detection Systems

In modern traffic management Video Image Detection Systems (VIDS) are becoming increasingly important as traffic sensors. They are getting more affordable and don’t require any road construction like commonly used induction loops. Furthermore, due to the f ...

2008

Snakuscules

Michaël Unser, Philippe Thévenaz

A snakuscule (a minuscule snake) is the simplest active contour that we were able to design while keeping the quintessence of traditional snakes: an energy term governed by the data, and a regularization term. Our construction is an area-based snake, as op ...

IEEE2008

The continuous wavelet transform on conic sections

Pierre Vandergheynst, Iva Bogdanova Vandergheynst

We review the known construction of the continuous wavelet transform (CWT) on the two-sphere. Next we describe the construction of a CWT on the upper sheet of a two- sheeted hyperboloid, emphasizing the similarities between the two cases. Finally we give s ...

2008

The continous wavelet transform on conic sections

Pierre Vandergheynst, Iva Bogdanova Vandergheynst

We review the coherent state or group-theoretical construction of the continuous wavelet transform (CWT) on the two-sphere. Next we describe the construction of a CWT on the upper sheet of a two-sheeted hyperboloid, emphasizing the similarities between the ...

2008

Dynamic programming approach to optimal design of cascade stilling basins

Roham Bakhtyar

Energy dissipation systems such as single fall-stilling basin and single chute bucket have been used in the design and construction of large dams. In the case of high head structures, however, due to the high flow velocity, these systems suffer from proble ...

2007

Spectral coarse graining of complex networks

Paolo De Los Rios, David Gfeller

Reducing the complexity of large systems described as complex networks is key to understanding them and a crucial issue is to know which properties of the initial system are preserved in the reduced one. Here we use random walks to design a coarse graining ...

American Physical Society2007

Alexandre Sarrasin (1895-1976) et l'esthétique de l'ingénieur

Philippe Mivelaz

Alexandre Sarrasin (1895-1976) studied at Zürich Federal Swiss Institute of Technology (ETH) from 1913 to 1918. Despite First World War's conflicts surrounding the neutral Switzerland, the intellectual climate inside ETH was cosmopolitan and liberal. As un ...

EPFL2007

Chosen-prefix collisions for MD5 and colliding X.509 certificates for different identities

Arjen Lenstra

We present a novel, automated way to find differential paths for MD5. As an application we have shown how, at an approximate expected cost of 2 50 calls to the MD5 compression function, for any two chosen message prefixes P and P′, suffixe ...

2007