Publication

Graph fragmentation problem: analysis and synthesis

Publications associées (66)

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

Lucky Read/Write Access to Robust Atomic Storage

Rachid Guerraoui, Marko Vukolic, Ron Levy

This paper establishes tight bounds on the best-case time-complexity of distributed atomic read/write storage implementations that tolerate worst-case conditions. We study asynchronous robust implementations where a writer and a set of reader processes (cl ...

2005

Interpolation-based QR decomposition in MIMO-OFDM systems

Andreas Peter Burg

The extension of multiple-input multiple-output (MIMO) sphere decoding from the narrowband case to wideband systems based on orthogonal frequency division multiplexing (OFDM) requires the computation of a QR decomposition for each of the data-carrying OFDM ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2005

Distance transformations: fast algorithms and applications to medical image processing

Olivier Cuisenaire

Medical image processing is a demanding domain, both in terms of CPU and memory requirements. The volume of data to be processed is often large (a typical MRI dataset requires 10 MBytes) and many processing tools are only useful to the physician if they ar ...

1999

On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons

This work is concerned with the computational complexity of the recognition of

ÞPtwo

, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Some subclasses of

ÞPtwo

of particular interest are also studi ...

1999

On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons

This work is concerned with the computational complexity of the recognition of

ÞPtwo

, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Some subclasses of

ÞPtwo

of particular interest are also studi ...

IDIAP1998

On the Complexity of the Class of Regions Computable by a Two-Layered Perceptron

This work is concerned with the computational complexity of the recognition of

\mbox{LP}_2

, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Several subclasses of

\mbox{LP}_2

of particular interest ...

IDIAP1996

On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons

This work is concerned with the computational complexity of the recognition of

ÞPtwo

, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Some subclasses of

ÞPtwo

of particular interest are also studi ...

IDIAP1998

On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons

This work is concerned with the computational complexity of the recognition of

ÞPtwo

, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Some subclasses of

ÞPtwo

of particular interest are also studi ...

1999

On the Complexity of the Class of Regions Computable by a Two-Layered Perceptron

This work is concerned with the computational complexity of the recognition of

\mbox{LP}_2

, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Several subclasses of

\mbox{LP}_2

of particular interest ...

IDIAP1996