#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1993

2015

- This year (0)
- Last 5 years (1)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- C. Khalil, C. Hancart, V. Le Thuc, C. Chantelot, D. Chechin, A. Cotten
- European Radiology
- 2008

The purpose was to demonstrate the feasibility of in vivo diffusion tensor imaging (DTI) and tractography of the human median nerve with a 1.5-T MR scanner and to assess potential differences in diffusion between healthy volunteers and patients suffering from carpal tunnel syndrome. The median nerve was examined in 13 patients and 13 healthy volunteers with… (More)

- Christophe Hancart
- Inf. Process. Lett.
- 1993

- Maxime Crochemore, Christophe Hancart, Thierry Lecroq
- J. Discrete Algorithms
- 2003

String matching is the problem of finding all the occurrences of a pattern in a text. We present a new method to compute the combinatorial shift function (“matching shift”) of the well-known Boyer–Moore string matching algorithm. This method implies the computation of the length of the longest suffixes of the pattern ending at each position in this pattern.… (More)

String matching is the problem of finding all the occurrences of a string, called the pattern, within another, called the text. We give sharp bounds when only one head moving from the left to the right of the text is used, for the general case where the alphabet is unknown to the algorithms : b(2 − 1 m) nc comparisons between pattern characters and text… (More)

- Frederic Green, Maxime Crochemore, +12 authors Richard Dunlap
- 2015

4. Polyhedral and Algebraic Methods in Computational Geometry, by Michael Joswig and Thorsten Theobald. Reviewed by Brittany Terese Fasy and David L. Millman. This book treats a wide array of topics, beginning from the basics (e.g., convex hulls) and proceeding through the fundamental tools of computational algebraic geometry (e.g., Gröbner bases), and… (More)

- ‹
- 1
- ›