#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1985

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Willi Mann, Nikolaus Augsten, Panagiotis Bouros
- PVLDB
- 2016

Set similarity joins compute all pairs of similar sets from two collections of sets. We conduct extensive experiments on seven state-of-the-art algorithms for set similarity joins. These algorithms adopt a filter-verification approach. Our analysis shows that verification has not received enough attention in previous works. In practice, efficient… (More)

- Willi Mann, Nikolaus Augsten
- Grundlagen von Datenbanken
- 2014

Set similarity joins compute all pairs of similar sets from two collections of sets. Set similarity joins are typically implemented in a filter-verify framework: a filter generates candidate pairs, possibly including false positives, which must be verified to produce the final join result. Good filters produce a small number of false positives, while they… (More)

- Martin Held, Willi Mann
- CCCG
- 2011

In this paper we investigate how sophisticated floatingpoint codes that are in real-world use – VRONI for computing Voronoi diagrams, FIST for computing triangulations, and BONE for computing straight skeletons – can benefit from the use of the Core library (for exact geometric computing) or the MPFR library (for multiprecision arithmetic). We also discuss… (More)

We provide efficient support for applications that aim to continuously find pairs of similar sets in rapid streams of sets. A prototypical example setting is that of tweets. A tweet is a set of words, and Twitter emits about half a billion tweets per day. Our solution makes it possible to efficiently maintain the top-k most similar tweets from a pair of… (More)

- Willi Mann, Ulrich Joos
- Der Freie Zahnarzt
- 1985

- Willi Mann
- Science

- Willi Mann
- Maryland medical journal
- 1994

Newly developed technology and specially trained operators offer physicians and deaf or hard-of-hearing patients several options for communicating by telephone. This article discusses communication equipment, implications and benefits of direct physician/patient communication, removal of communication barriers, and confidentiality.

- Willi Mann, Martin Held, Stefan Huber
- CCCG
- 2012

We present an efficient algorithm for computing generalized motorcycle graphs, in which motorcycles are allowed to emerge after time zero. Our algorithm applies kinetic triangulations inside of the convex hull of the input, while a plane sweep is used outside of it. Its worst-case complexity is O((n + f) log n), where f ∈ O(n) denotes the number of flip… (More)

- ‹
- 1
- ›