#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1990

2014

- This year (0)
- Last 5 years (2)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ivan Morel, Damien Stehlé, Gilles Villard
- ISSAC
- 2009

We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are performed with floating-point arithmetic. We prove that a precision essentially equal to the dimension suffices to ensure that the output basis is reduced. H-LLL resembles the… (More)

- J Vorobioff, R J Groszmann, +8 authors M Passamonti
- Gastroenterology
- 1996

BACKGROUND & AIMS
Different parameters are considered predictors of bleeding and death in alcoholic cirrhosis. The aim of this study was to establish the prognostic value of a prospective and sequential evaluation of portal pressure, variceal size, and Pugh's score in portal-hypertensive patients with alcoholic cirrhosis but no previous bleeding.
METHODS… (More)

- Ivan Morel, Damien Stehlé, Gilles Villard
- ACM Comm. Computer Algebra
- 2008

Lattice reduction has important applications in very diverse elds of both mathematics and computer science: computer algebra, cryptology, algorithmic number theory, algorithmic group theory, MIMO communications, computer arithmetic, etc. The LLL algorithm allows one to reduce a basis to a 'good basis' (as de ned by Lovász in [1]) in polynomial time. However… (More)

- Saruchi, Ivan Morel, Damien Stehlé, Gilles Villard
- ISSAC
- 2014

Let <i>B</i> be a basis of a Euclidean lattice, and B an approximation thereof. We give a sufficient condition on the closeness between B and <i>B</i> so that an LLL-reducing transformation <i>U</i> for B remains valid for <i>B</i>. Further, we analyse an efficient reduction algorithm when <i>B</i> is itself a small deformation of an LLL-reduced basis.… (More)

- Ivan Morel, Damien Stehlé, Gilles Villard
- Technique et Science Informatiques
- 2010

The algorithmic facet of euclidean lattices is a frequent tool in computer science and mathematics. It mainly relies on the LLL reduction, making worthwile efficiency improvements. Schnorr proved that the LLL algorithm can be speeded up if one computes approximations to the underlying Gram-Schmidt orthogonalisations. Without approximations, these… (More)

- C Racinet, M R Mallaret, +5 authors C Doublier
- Presse medicale
- 1990

Caesarean sections are performed with an ever increasing frequency, and their morbidity rate due to infection varies between 35 and 40 per cent. The effectiveness of antibiotic prophylaxis has been demonstrated in caesarean sections with a high risk of infection, but few studies have been devoted to caesarean sections without this high risk. The purpose of… (More)

- C Racinet, M R Mallaret, I Morel, J Berthet, J Fauconnier
- Presse medicale
- 1992

- H Rodriguez, Y Heredia, +4 authors T DiSessa
- 2013

Results Patient is a male age 21 yo, without relevant past medical history and class I NYHA. Six months prior to diagnosis presented he several episodes of syncope like symptoms and chest pain, that limited his physical activity. Preemployment medical evaluation revealed a systolic murmur III / VI throughout the precordium with radiation to the neck,… (More)

- ‹
- 1
- ›