Sciweavers

471 search results - page 32 / 95
» On the Relative Dominance of Paging Algorithms
Sort
View
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
15 years 11 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
DM
2008
112views more  DM 2008»
14 years 10 months ago
On the vertices of the k-additive core
The core of a game v on N, which is the set of additive games dominating v such that (N) = v(N), is a central notion in cooperative game theory, decision making and in combinator...
Michel Grabisch, Pedro Miranda
SIGIR
1998
ACM
15 years 2 months ago
Improved Algorithms for Topic Distillation in a Hyperlinked Environment
This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic. Connectivity...
Krishna Bharat, Monika Rauch Henzinger
WWW
2005
ACM
15 years 10 months ago
Partitioning of Web graphs by community topology
We introduce a stricter Web community definition to overcome boundary ambiguity of a Web community defined by Flake, Lawrence and Giles [2], and consider the problem of finding co...
Hidehiko Ino, Mineichi Kudo, Atsuyoshi Nakamura
JAIR
2006
74views more  JAIR 2006»
14 years 9 months ago
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...