Sciweavers

471 search results - page 2 / 95
» On the Relative Dominance of Paging Algorithms
Sort
View
ICDE
2008
IEEE
131views Database» more  ICDE 2008»
14 years 7 months ago
On Skylining with Flexible Dominance Relation
Given a set of d dimensional objects, a skyline query finds the objects ("skyline") that are not dominated by others. However, skylines do not always provide useful query...
Tian Xia, Donghui Zhang, Yufei Tao
BMCBI
2008
91views more  BMCBI 2008»
13 years 6 months ago
PageRank without hyperlinks: Reranking with PubMed related article networks for biomedical text retrieval
Background: Graph analysis algorithms such as PageRank and HITS have been successful in Web environments because they are able to extract important inter-document relationships fr...
Jimmy J. Lin
JCSS
2007
89views more  JCSS 2007»
13 years 6 months ago
The relative worst-order ratio applied to paging
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition ...
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
IUI
2006
ACM
14 years 3 days ago
Recovering semantic relations from web pages based on visual cues
Recovering semantic relations between different parts of web pages are of great importance for multi-platform web interface development, as they make it possible to re-distribute ...
Peifeng Xiang, Yuanchun Shi
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
13 years 5 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller