HitKeeper, a generic software package for hit list management (2007)
Hau, Jörg, Muller, Michael, Pagni, Marco
Abstract Background The automated annotation of biological sequences (protein, DNA) relies on the computation of hits (predicted features) on the sequences using various algorithms. Public databases...
Kaput, Jim, Ordovas, José, Ferguson, Lynnette, Van Ommen, Ben, Rodríguez, Raymond, Allen, Lindsay, ...
Nutrigenomics is the study of how constituents of the diet interact with genes, and their products, to alter phenotype and, conversely, how genes and their products metabolise these constituents into...
Creating Value Through Test (2003)
Erik Jan Marinissen, Bart Vermeulen, Robert Madge, Michael Kessler, Michael Muller, Ibm Deutschland, ...
Test is often seen as a necessary evil; it is a fact of life that ICs have manufacturing defects and those need to be filtered out by testing before the ICs are shipped to the customer. In this...
Prediction of the 2001 Leonid activity and an assessment of the spacecraft impact hazard (2003)
Muller, Michael, McBride, Neil, Green, Simon F., Zarnecki, John C.
Different maxima in the Leonid activity observed in the same year can be identified as due to dust particles ejected during different perihelion passages of the parent comet, 55P/Tempel-Tuttle. This...
How to gain Quality when developing a Repository Driven User Interface (1999)
this paper uses a sound architecture and object-oriented concepts. The use of a good architecture and concepts such as object orientation forces the developers to follow a certain pattern when...
An Implementation of a Convex Hull Algorithm Version 1.0 (1999)
Michael Muller, Joachim Ziegler
We give an implementation of an incremental construction algorithm for convex hulls in IR d using Literate Programming and LEDA in C++. We treat convex hulls in arbitrary dimensions without any...
The Tate Pairing and the Discrete Logarithm Applied to Elliptic Curve Cryptosystems (1998)
Gerhard Frey, Michael Muller, Hans-georg Ruck
to the addition in J. 3. Given a cyclic subgroup Cm of order m in Jm (F q ) then the probability to find a point P 0 in J(F q ) with fOE m (P; P 0 ); P 2 Cm g = ¯m (F q ) is positive ( depending on...
The Tate Pairing and the Discrete Logarithm (1998)
Gerhard Frey, Michael Muller, Hans-georg Ruck
lable. In [R] it is explained how to treat the case that m is a power of the characteristic of Fq , in the case of elliptic curves see [Sem]. 2 Application to elliptic curves We assume now that E is...
Arithmetic of Modular Curves and Applications (1998)
The aim of this article is to describe a computational approach to the study of the arithmetic of modular curves X 0 (N) and to give applications of these computations. 1 Introduction Let K be a...
Arithmetic of Modular Curves and Applications (1998)
The aim of this article is to describe a computational approach to the study of the arithmetic of modular curves X 0 (N) and to give applications of these computations.
Convex Hulls in Higher-dimensional Space (1998)
Michael Muller, Joachim Ziegler, Kurt Mehlhorn, Michael Seel
We define and implement the data type chull . It maintains convex hulls in arbitrary dimensions and supports insertions of points and membership queries. The interior of the hull and the boundary of...
Michael Muller, Joachim Ziegler, Kurt Mehlhorn
We define and implement the data type chull. It maintains convex hulls in arbitrary dimensions and supports insertions of points and membership queries. The interior of the hull and the boundary of...
Higher-dimensional Convex Hulls and Delaunay Triangulations Specification and Implementation (1997)
Kurt Mehlhorn, Michael Muller, Stefan Naher, Joachim Ziegler
Introduction We discuss the specification and implementation of the data types convex hull and Delaunay triangulation for higher-dimensional space. We aimed for ffl rich functionality and ease of use...