Sciweavers

428 search results - page 35 / 86
» Completeness of a Fact Extractor
Sort
View
SIGIR
2004
ACM
15 years 5 months ago
Retrieval evaluation with incomplete information
This paper examines whether the Cranfield evaluation methodology is robust to gross violations of the completeness assumption (i.e., the assumption that all relevant documents wi...
Chris Buckley, Ellen M. Voorhees
ICDT
2001
ACM
162views Database» more  ICDT 2001»
15 years 4 months ago
Algebraic Rewritings for Optimizing Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in query optimization, data integration, data warehousing etc. Query rewriting in relational databases ...
Gösta Grahne, Alex Thomo
CAIP
1999
Springer
145views Image Analysis» more  CAIP 1999»
15 years 4 months ago
Optimized Fast Algorithms for the Quaternionic Fourier Transform
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...
Michael Felsberg, Gerald Sommer
FC
1999
Springer
184views Cryptology» more  FC 1999»
15 years 4 months ago
Flow Control: A New Approach for Anonymity Control in Electronic Cash Systems
Abstract. Anonymity features of electronic payment systems are important for protecting privacy in an electronic world. However, complete anonymity prevents monitoring financial t...
Tomas Sander, Amnon Ta-Shma
COCO
1989
Springer
97views Algorithms» more  COCO 1989»
15 years 3 months ago
On the Structure of Bounded Queries to Arbitrary NP Sets
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
Richard Chang