Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
We propose that the information access behavior of a group of people can be modeled as an information flow issue, in which people intentionally or unintentionally influence and in...
Xiaodan Song, Belle L. Tseng, Ching-Yung Lin, Ming...
This paper is to investigate the group behavior patterns of search activities based on Web search history data, i.e., clickthrough data, to boost search performance. We propose a ...
Due to the reliance on the textual information associated with an image, image search engines on the Web lack the discriminative power to deliver visually diverse search results. ...
Reinier H. van Leuken, Lluis Garcia Pueyo, Ximena ...