Concept

Lattice (order)

Related publications (118)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A mealy machine with polynomial growth of irrational degree

We consider a very simple Mealy machine ( two nontrivial states over a two-symbol alphabet), and derive some properties of the semigroup it generates. It is an infinite, finitely generated semigroup, and we show that the growth function of its balls behave ...

2008

Transport exponent in a three-dimensional continuum tunneling-percolation model

Peter Ryser, Claudio Grimaldi, Niklaus Johner

The tunneling-percolation mechanism of conduction in disordered conductor-insulator composites is studied for a realistic continuum model where conducting and impenetrable spherical particles are dispersed in a three-dimensional continuum insulating materi ...

2008

Reversible, fast, and high-quality grid conversions

Dimitri Nestor Alice Van De Ville

A new grid conversion method is proposed to resample between two 2-D periodic lattices with the same sampling density. The main feature of our approach is the symmetric reversibility, which means that when using the same algorithm for the converse operatio ...

Institute of Electrical and Electronics Engineers2008

Practical Box Splines for Reconstruction on the Body Centered Cubic Lattice

Dimitri Nestor Alice Van De Ville

We introduce a family of box splines for efficient, accurate, and smooth reconstruction of volumetric data sampled on the body-centered cubic (BCC) lattice, which is the favorable volumetric sampling pattern due to its optimal spectral sphere packing prope ...

IEEE2008

Minimum euclidien des ordres maximaux dans les algèbres centrales à division

Jérôme Chaubert

This work concerns the study of Euclidean minima of maximal orders in central simple algebras. In the first part, we define the concept of ideal lattice in the non-commutative case. Let A be a semi-simple algebra over Q. An ideal lattice over A is a triple ...

EPFL2007

Property (T) and rigidity for actions on Banach spaces

Nicolas Monod

We study property (T) and the fixed point property for actions on Lp and other Banach spaces. We show that property (T) holds when L2 is replaced by Lp (and even a subspace/quotient of Lp), and that in fact it is independent of 1 ≤ p < ∞. We show that the ...

2007

The generic Gröbner walk

The Gröbner walk is an algorithm for conversion between Gröbner bases for different term orders. It is based on the polyhedral geometry of the Gröbner fan and involves tracking a line between cones representing the initial and target term order. An importa ...

2007

Comparing Different Word Lattice Rescoring Approaches Towards Keyword Spotting

Hervé Bourlard, Hynek Hermansky, Joel Praveen Pinto

In this paper, we further investigate the large vocabulary continuous speech recognition approach to keyword spotting. Given a speech utterance, recognition is performed to obtain a word lattice. The posterior probability of keyword hypotheses in the latti ...

IDIAP2007

Anonymous and Fault-Tolerant Shared-Memory Computing

Rachid Guerraoui, Eric Ruppert

The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge them for re ...

2007

Anonymous and fault-tolerant shared-memory computing

Rachid Guerraoui, Eric Ruppert

Springer, Springer-Verlag2007