Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
Most modern computer vision systems for high-level
tasks, such as image classification, object recognition and
segmentation, are based on learning algorithms that are
able to se...
In this paper we discuss object detection when only a small number of training examples are given. Specifically, we show how to incorporate a simple prior on the distribution of n...
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...