2152 search results - page 313 / 431 » A Comparative Study of 2QBF Algorithms |
170
click to vote
CIKM
1999
Springer
15 years 11 months ago
1999
Springer
In this paper we compare performance of several heuristics in generating informative generic/query-oriented extracts for newspaper articles in order to learn how topic prominence ...
207
click to vote
PODS
2008
ACM
16 years 7 months ago
2008
ACM
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
204
click to vote
VTC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—This paper studies the performance of orthogonal frequency division multiple access – time division duplex (OFDMA-TDD) cellular networks when jointly applying dynamic ...
179
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
193
click to vote
ESA
2005
Springer
16 years 9 days ago
2005
Springer
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...