We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definit...
We study the 1-center problem with outliers in highdimensional data streams. The problem definition is as follows: given a sequence of n points in d dimensions (with d arbitrarily...
Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
We consider a special class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key with...
Various notions of coverage provided by wireless sensor networks have attracted considerable attention over the past few years. In general, coverage can be expressed geometrically...
—Most research works focus on pattern recognition within a small sample images but strategies for running efficiently these algorithms over large images are rarely if ever speci...
Antoine Veillard, Nicolas Lomenie, Daniel Racocean...