Concept

Invariant basis number

Publications associées (16)

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

Arithmetic Bounds-Lenstra's Constant and Torsion of K-Groups

Julien Houriet

This thesis is concerned with computations of bounds for two different arithmetic invariants. In both cases it is done with the intention of proving some algebraic or arithmetic properties for number fields. The first part is devoted to computations of low ...

EPFL2010

Designing peer-to-peer overlays

Sarunas Girdzijauskas

The Small-World phenomenon, well known under the phrase "six degrees of separation", has been for a long time under the spotlight of investigation. The fact that our social network is closely-knitted and that any two people are linked by a short chain of a ...

EPFL2009

Fuzzynet: Zero-maintenance Ringless Overlay

Karl Aberer, Anwitaman Datta, Wojciech Galuba, Sarunas Girdzijauskas

Many structured overlay networks rely on a ring invariant as a core network connectivity element. The responsibility ranges of the participating peers and navigability principles (greedy routing) heavily depend on the ring structure. For correctness guaran ...

2008

The challenges of merging two similar structured overlays: A tale of two networks

Karl Aberer, Anwitaman Datta

Structured overlay networks is an important and interesting primitive that can be used by diverse peer-to-peer applications. Multiple overlays can result either because of network partitioning or (more likely) because different groups of peers build such o ...

Springer2006

Finite-dimensional approximation of Gaussian processes

Giancarlo Ferrari Trecate

Gaussian process (GP) prediction suffers from O(n^3) scaling with the data set size n. By using a finite-dimensional basis to approximate the GP predictor, the computational complexity can be reduced. We derive optimal finite-dimensional predictors under a ...

MIT Press1999

Testing of Ada Abstract Data Types using Formal Specifications

The purpose of this paper is to present an experiment with formal methods for the black-box testing of reusable abstract data types (ADTs). We propose to test a family of software components by re-engineering a formal specification from an existing Ada imp ...

Springer Verlag1994