We propose a framework for searching the Wikipedia with contextual information. Our framework extends the typical keyword search, by considering queries of the type q, p , where q...
Antti Ukkonen, Carlos Castillo, Debora Donato, Ari...
Abstract. Enabling coordination among ubiquitous computing applicad resources requires programming abstractions and development tools tailored to this unique environment. This pape...
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
Abstract. Different security notions and settings for identification protocols have been proposed so far, considering different powerful adversaries that can play "man-in-the-...
Carlo Blundo, Giuseppe Persiano, Ahmad-Reza Sadegh...