Concept

Cyclic order

Publications associées (19)

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

On Decision Procedures for Ordered Collections

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

We describe a decision procedure for a logic that supports 1) finite collections of elements (sets or multisets), 2) the cardinality operator, 3) a total order relation on elements, and 4) min and max operators on entire collections. Among the applications ...

2010

Propagation and absorption of low frequency waves in two and three dimensional warm plasmas

Nicolas Mellet

In order to model a broader range of phenomena taking place in three-dimensional plasmas, the LEMan code has been extended to a warm formulation. As the wave propagation is strongly influenced by the parallel wave vector, special attention has been paid fo ...

EPFL2009

Distributed Similarity Search in High Dimensions Using Locality Sensitive Hashing

Karl Aberer, Sebastian Michel, Parisa Haghani

In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH) which has proven very efficient in answering KNN queries in centralized set ...

2009

Cayley Graphs and growth of groups

Nathalie Pellet

One of the most fundamental objects in algebra is the group. There exist plenty of different groups. In the following article we consider some free abelian gorups, cyclic groups, free groups and fundamental groups as well as the products of groups and draw ...

2008

On the capacity of large Gaussian relay networks

Martin Vetterli, Michael Christoph Gastpar

The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is ...

Institute of Electrical and Electronics Engineers2005

On the Capacity of Large Gaussian Relay Networks

Martin Vetterli, Michael Christoph Gastpar

2005

Totally Ordered Broadcast and Multicast Algorithms: A Comprehensive Survey

André Schiper, Xavier Défago

Total order multicast algorithms constitute an important class of problems in distributed systems, especially in the context of fault-tolerance. In short, the problem of total order multicast consists in sending messages to a set of processes, in such a wa ...

2000

Stickelberger Codes

Mohammad Amin Shokrollahi

Let

p

be an odd prime and

zeta_p

be a primitive pth root of unity over

smallBbbQ

. The Galois group

G

K:=smallBbbQ(zeta_p)

over

smallBbbQ

is a cyclic group of order

p-1

. The integral group ring

smallBbbZ[G]

contains the Stickelberger idea ...

1996

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