In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
In order to support the navigation in huge document collections efficiently, tagged hierarchical structures can be used. Often, multiple tags are used to describe resources. For u...
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
In this paper, we use the structural and relational information on the Web to find entity-pages. Specifically, given a Web site and an entity-page (e.g., department and faculty ...
Tim Weninger, Fabio Fumarola, Cindy Xide Lin, Rick...
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...