10792 search results - page 116 / 2159 » An Evaluation of Non-Equijoin Algorithms |
92
Voted
ANTS
1998
Springer
15 years 5 months ago
1998
Springer
We describe two techniques for fast multiple-precision evaluation of linearly convergent series, including power series and Ramanujan series. The computation time for N bits is O(...
90
Voted
CIE
2005
Springer
15 years 20 days ago
2005
Springer
ACL
2010
14 years 10 months ago
2010
We present the S-Space Package, an open source framework for developing and evaluating word space algorithms. The package implements well-known word space algorithms, such as LSA,...
109
Voted
SAT
2004
Springer
15 years 6 months ago
2004
Springer
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
136
Voted
NJC
2006
15 years 21 days ago
2006
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...