Concept

Ensemble partiellement ordonné

Publications associées (80)

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

Separation theorems and partial orderings for sensor network problems

Michael Christoph Gastpar

In the absence of complexity and delay constraints, the quality of a noisy communication channel can be characterized by a single number, called its capacity and usually measured in bits. Shannon [1] showed that this number is universal in the sense that v ...

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

Mechanisms for store-wait-free multiprocessors

Anastasia Ailamaki, Babak Falsafi

Store misses cause significant delays in shared-memory multiprocessors because of limited store buffering and ordering constraints required for proper synchronization. Today, programmers must choose from a spectrum of memory consistency models that reduce ...

2007

Online Coloring of Comparability Graphs: some results

Benjamin Leroy-Beaulieu

We study online partitioning of posets from a graph theoretical point of view, which is coloring and cocoloring in comparability graphs. For the coloring problem, we analyse the First-Fit algorithm and show a ratio of

O(\sqrt{n})

; furthermore, we devise ...

2007

Multi-stage code generator and decoder for communication systems

Mohammad Amin Shokrollahi

A method of encoding data for transmission from a source to a destination over a communications channel is provided. A plurality of redundant symbols are generated from an ordered set of input symbols to be transmitted. A plurality of output symbols are ge ...

2006

Drug loading of porous coating

Heinrich Hofmann, Laurent-Dominique Piveteau

Porous coating for the controlled release of drugs, said coating comprising a porous structure with pores adapted to act as reservoirs or as passages for a drug, in such a way that said drug can move from the external environment to/from or through said po ...

2006

E1 empty set E4 protein of human papillomavirus type 16 associates with mitochondria

Peter Martin Beard

The human papillomavirus (HPV) E1 empty set E4 protein is the most abundantly expressed viral protein in HPV-infected epithelia. It possesses diverse activities, including the ability to bind to the cytokeratin network and to DEAD-box proteins, and in some ...

2004

FACTS, which advantages for the modern electrical networks?

Jean-Jacques Simond, Alain Sapin

The energy market liberalization requires using the actual transportation network in a more flexible and more efficient way. What is needed are strategies and facilities that will improve the energy flux sharing, as well as the maintaining of the node volt ...

2000

Self-organized growth of cluster arrays

Klaus Kern, Harald Brune, Marcella Giovannini

We present a novel method for the fabrication of well-ordered, two-dimensional nanocluster arrays. The method is based on the confined nucleation of adatoms within the superstructure cells of periodic surface dislocation networks, which form in many hetero ...

1999

B-Site Order and Infrared Reflectivity in a(B'b'')O3 Complex Perovskite Ceramics

Nava Setter

Complex perovskite A(B'B'')O3 ceramics with various degrees of B-site order have been structurally and spectroscopically characterized by means of x-ray diffraction, transmission electron microscopy, and infrared reflectivity. In Ba(Fe1/2Nb1/2)O3 and Pb(Fe ...

1994

A note on order preserving matchings

Thomas Liebling, François Margot

We study order preserving injections or bipartite matchings from poset V1 to poset V2. When V1 is totally ordered, we give an efficient algorithm for the associated optimization problem and the convex hull of the corresponding characteristic vectors. If V2 ...

1989

Online Coloring of Comparability Graphs: some results

Benjamin Leroy-Beaulieu

O(\sqrt{n})

; furthermore, we devise ...

2007