Sciweavers

471 search results - page 10 / 95
» On the Relative Dominance of Paging Algorithms
Sort
View
JCO
2006
83views more  JCO 2006»
14 years 9 months ago
Separating online scheduling algorithms with the relative worst order ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
ICDAR
2009
IEEE
15 years 4 months ago
Voronoi++: A Dynamic Page Segmentation Approach Based on Voronoi and Docstrum Features
This paper presents a dynamic approach to document page segmentation. Current page segmentation algorithms lack the ability to dynamically adapt local variations in the size, orie...
Mudit Agrawal, David S. Doermann
AAAI
2011
13 years 9 months ago
Markov Logic Sets: Towards Lifted Information Retrieval Using PageRank and Label Propagation
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
Marion Neumann, Babak Ahmadi, Kristian Kersting
ICDE
2008
IEEE
2751views Database» more  ICDE 2008»
16 years 9 months ago
Skyline Query Processing for Incomplete Data
Recently, there has been much interest in processing skyline queries for various applications that include decision making, personalized services, and search pruning. Skyline queri...
Justin J. Levandoski, Mohamed E. Khalefa, Mohamed ...
WAW
2007
Springer
91views Algorithms» more  WAW 2007»
15 years 3 months ago
Determining Factors Behind the PageRank Log-Log Plot
Abstract. We study the relation between PageRank and other parameters of information networks such as in-degree, out-degree, and the fraction of dangling nodes. We model this relat...
Yana Volkovich, Nelly Litvak, Debora Donato