We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Abstract. A nearest neighbor search procedure is presented, for retrieving resources in knowledge bases expressed in OWL. The procedure exploits a semidistance for annotated resour...
Blog links raise three key questions: Why did the author make the link, what exactly is he pointing at, and what does he feel about it? In response to these questions we introduce...
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Robots in a swarm construction system need to be able to find their way to all potential places to add material to a structure. In two dimensions, a (trivial) procedure exists fo...