# Emo Welzl

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Theor. Comput. Sci.
- 2016

Sample compression schemes are schemes for “encoding” a set of examples in a small subset of examples. The long-standing open… (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- CHI
- 2012

We present AffectAura, an emotional prosthetic that allows users to reflect on their emotional states over long periods of time… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- SODA
- 2006

The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- ICALT
- 2001

There is an interplay between emotions and learning, but this interaction is far more complex than previous theories have… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Algorithmica
- 2001

Let A and B be two sets of n objects in \reals d , and let Match be a (one-to-one) matching between A and B . Let min(Match… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- FOCS
- 2000

We propose a combinatorial approach to plan noncolliding motions for a polygonal bar-and-joint framework. Our approach yields… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- ICDT
- 1999

Partitioning a multi-dimensional data set into rectangular partitions subject to certain constraints is an important problem that… (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- 1997

About ten years ago, the eld of range searching, especially simplex range searching, was wide open. At that time, neither e cient… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Discrete & Computational Geometry
- 1995

We investigate the problem of finding the best solution satisfying all but k of the given constraints, for an abstract class of… (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- SODA
- 1990

A binary space parWon, or BSP, is a scheme for recursively dividing a configuration of objects by hyperplanes until all objects… (More)

Is this relevant?