We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
An ensemble is a set of learned models that make decisions collectively. Although an ensemble is usually more accurate than a single learner, existing ensemble methods often tend ...
In the foreseeable future, software testing will remain one of the best tools we have at our disposal to ensure software dependability. Empirical studies are crucial to software t...
The context of a search query often provides a search engine meaningful hints for answering the current query better. Previous studies on context-aware search were either focused ...