ALL NEAR NEIGHBOR GRAPHWITHOUT SEARCHING

All Near Neighbor GraphWithout Searching

Given a collection of n objects equipped with a distance function d(·, ·), the Nearest Neighbor Graph (NNG) consists in finding the nearest neighbor of each object in the collection.Without an index the total cost of NNG is quadratic.Using Audio Accessory an index the cost would be sub-quadratic if the search for individual items is sublinear.Unf

read more

The robotic mentalist – On the influences of robots’ mentalizing abilities and external manipulative intent on people’s credibility attributions

Robots are used in various social interactions that require them to be perceived as credible agents (e.g., as product recommenders in shopping malls).To be rated credible (i.e., competent, trustworthy, and caring) a robot’s mentalizing abilities have shown to be beneficial because they allow a robot to infer users’ inner states, thus serving as

read more