— This paper presents a new method for reactive collision avoidance for mobile robots in complex and cluttered environments. Our technique is to adapt the “divide and conquer...
Although personalized search has been proposed for many years and many personalization strategies have been investigated, it is still unclear whether personalization is consistent...
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
The Stanford Power Browser project addresses the problems of interacting with the World-Wide Web through wirelessly connected Personal Digital Assistants (PDAs). These problems in...
Orkut Buyukkokten, Hector Garcia-Molina, Andreas P...
In the context of computer-assisted plant identification we are facing challenging information retrieval problems because of the very high within-class variability and of the lim...