Concept

Enumeration

Related publications (21)

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.

On the Impossibility of Strong Encryption over \aleph_{0}

Serge Vaudenay

We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second one relates to computationally secure encryption resisting adaptive chosen ciphe ...

Springer Berlin / Heidelberg2009

Gravity Solitary Waves By Minimization: An Uncountable Family

Boris Buffoni

We improve and simplify the minimization method for solitary waves in two cases: firstly, when the surface tension is weak (that is, the Bond number is < 1/3) and the depth is finite, and secondly, when the depth is infinite. In a previous work on the firs ...

2009

Cooperative Localization for Autonomous Underwater Vehicles

Alexander Bahr

This paper describes an algorithm for distributed acoustic navigation for Autonomous Underwater Vehicles (AUVs). Whereas typical AUV navigation systems utilize pre-calibrated arrays of static transponders, our work seeks to create a fully mobile network of ...

2009

A method for the enumeration of the floppy modes and the calculation of the associated entropy

Giuseppe Foffi

We present a method that is based on the Ladd-Frenkel (LF) thermodynamic integration for the study of the rigidity of networks of particles bonded together by short-ranged square well attractive potentials. We show that, by taking the limit of the attracti ...

2008

Undecidable propositions by ODE's

The authors define a family of functions by starting with (complex) exponentials and closing under some basic algebraic operations, integration, and solution of certain systems of differential equations. They then show that for every recursively (computabl ...

2007

0/1 vertex and facet enumeration with BDDs

Friedrich Eisenbrand

In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Another one is the convex hull problem: Given a set of 0/1 points in dimension d, ...

2007

Electromagnetic modelling of planar circuits in bounded layered media

Pedro Crespo Valero

Printed circuits in bounded media encompass a wide range of practical structures such as discontinuities in waveguides, planar circuits embedded in shielded multilayered media or even two-dimensional printed periodic structures. The Electromagnetic (EM) mo ...

EPFL2007

A catalog of minimally nonideal matrices

François Margot

This paper describes a backtracking algorithm for the enumeration of nonisomorphic minimally nonideal (n2n) matrices that are not degenerate projective planes. The application of this algorithm for nh12 yielded 20 such matrices, adding 5 matrices to the 15 ...

1998

The 3-regular nets with 4 and 6 vertices per unit cell

The 3-regular nets with 4 and 6 vertices per unit cell are enumerated. The large number of nets obtained (5 nets and 269 nets resp.) is in stark contrast to the relatively small number of nets which are of crystallographic interest. This subset of crystall ...

1997

Système de poids sur une algèbre de Lie nilpotente

Let g be a nilpotent Lie algebra (of finite dimension n over an algebraically closed field of characteristic zero) and let Der(g) be the algebra of derivations of g. The system of weights of g is defined as being that of the standard representation of a "m ...

s.n.1973