471 search results - page 32 / 95 » On the Relative Dominance of Paging Algorithms |
220
click to vote
ICDE
1999
IEEE
16 years 5 months ago
1999
IEEE
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...
112
click to vote
DM
2008
15 years 4 months ago
2008
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...
125
click to vote
SIGIR
1998
ACM
15 years 8 months ago
1998
ACM
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...
117
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
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...
110
click to vote
JAIR
2006
15 years 4 months ago
2006
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...