The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
When authors publish their interpretations of the ideas, opinions, claims or rebuttals in the literature, they are drawing on a repertoire of well understood moves, contributing t...
Bertrand Sereno, Simon Buckingham Shum, Enrico Mot...
Recent work on incremental crawling has enabled the indexed document collection of a search engine to be more synchronized with the changing World Wide Web. However, this synchron...
Lipyeow Lim, Min Wang, Sriram Padmanabhan, Jeffrey...
We address the problem of measuring global quality metrics of search engines, like corpus size, index freshness, and density of duplicates in the corpus. The recently proposed est...
Web sites that accept and display content such as wiki articles or comments typically filter the content to prevent injected script code from running in browsers that view the sit...