612 search results - page 18 / 123 » Using Data Compressors to Construct Rank Tests |
96
Voted
ICDE
2011
IEEE
14 years 1 months ago
2011
IEEE
—Complex SQL queries are widely used today, but it is rather difficult to check if a complex query has been written correctly. Formal verification based on comparing a specifi...
SIGIR
2006
ACM
15 years 4 months ago
2006
ACM
Accurate estimation of information retrieval evaluation metrics such as average precision require large sets of relevance judgments. Building sets large enough for evaluation of r...
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
72
Voted
HT
2010
ACM
15 years 3 months ago
2010
ACM
The rise of social interactions on the Web requires developing new methods of information organization and discovery. To that end, we propose a generative community-based probabil...
FATES
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents a method for reducing the cost of test generation. A spanning set for a coverage criterion is a set of entities such that exercising every entity in the spannin...