Concept

Algèbre universelle

Publications associées (26)

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

Parametric Resonance in Time-Dependent Networks of Hopf Oscillators

Max-Olivier Hongler, Julio Rodriguez

We study a collection of limit cycle oscillators with different frequencies interacting via networks. With static networks, our specific class of models produces a frequency learning mechanism leading the collection of oscillators to ultimately adopt a sin ...

2010

UniStore: Querying a DHT-based Universal Storage

Manfred Hauswirth, Roman Schmidt, Renault John Lecoultre, Jessica Müller

The idea of collecting and combining large public data sets and services became more and more popular. The special characteristics of such systems and the requirements of the participants demand for strictly decentralized solutions. However, this comes alo ...

2007

Runtime Checking for Program Verification

The process of verifying that a program conforms to its specification is often hampered by errors in both the program and the specification. A runtime checker that can evaluate formal specifications can be useful for quickly identifying such errors. This p ...

Springer2007

A Visual Query Language for Complex-Value Databases

Christoph Koch

In this paper, a visual language, VCP, for queries on complex-value databases is proposed. The main strength of the new language is that it is purely visual: (i) It has no notion of variable, quantification, partiality, join, pattern matching, regular expr ...

2006

UniStore: Querying a DHT-based Universal Storage

Manfred Hauswirth, Roman Schmidt, Renault John Lecoultre, Jessica Müller

In recent time, the idea of collecting and combining large public data sets and services became more and more popular. The special characteristics of such systems and the requirements of the participants demand for strictly decentralized solutions. However ...

2006

Light-weight Internet-scale Universal Storage

Manfred Hauswirth, Roman Schmidt

Many new applications, for example Wikis, social networks, and distributed recommender systems, require the efficient integration of decentralized and heterogenous data sources at a large scale. In this paper, we present our vision of a universal storage f ...

2006

Scaling between localization length and T-c in disordered YBa2Cu3O6.9

Davor Pavuna

We quantitatively study the effect of growth-induced reduction of long range structural order on the superconducting transition in epitaxial YBa2Cu3O6.9 films. The corresponding reduction of structural coherence length r(c) is determined from the width of ...

1999

Provable security for block ciphers by decorrelation

Serge Vaudenay

In this paper we investigate a new way of protecting block ciphers against classes of attacks (including differential and linear crypt-analysis) which is based on the notion of decorrelation which is fairly connected to Carter-Wegman's notion of universal ...

1998

Neural Network Classification and Formalization

In order to assist the field of neural networks in maturing, a formalization and a solid foundation are essential. Additionally, to permit the introduction of formal proofs, it is essential to have an all- encompassing formal mathematical definition of a n ...

North-Holland / Elsevier Science Publishers1994