An algorithm independent metric is introduced that measures the dispersion of a uniform random sample drawn from the top ranked percentiles of the search space. A low dispersion f...
: User interfaces to WWW search engines typically present results as ranked lists of documents. Such lists give users little help in understanding document variation: we propose a ...
Ivan Bretan, Johan Dewe, Anders Hallberg, Niklas W...
Web search is often viewed as a solitary task; however, there are many situations in which groups of people gather around a single computer to jointly search for information onlin...
In the current information age, the dominant method for information search is by providing few keywords to a search engine. Keyword search is currently one of the most important o...
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...