Sciweavers

1088 search results - page 123 / 218
» Probabilistic query expansion using query logs
Sort
View
SIGIR
2002
ACM
13 years 8 months ago
Cross-lingual relevance models
We propose a formal model of Cross-Language Information Retrieval that does not rely on either query translation or document translation. Our approach leverages recent advances in...
Victor Lavrenko, Martin Choquette, W. Bruce Croft
TREC
2000
13 years 10 months ago
Spoken Document Retrieval for TREC-9 at Cambridge University
This paper presents work done at Cambridge University for the TREC-9 Spoken Document Retrieval (SDR) track. The CUHTK transcriptions from TREC-8 with Word Error Rate (WER) of 20.5...
Sue E. Johnson, P. Jourlin, Karen Sparck Jones, Ph...
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
14 years 9 months ago
MayBMS: a probabilistic database management system
MayBMS is a state-of-the-art probabilistic database management system which leverages the strengths of previous database research for achieving scalability. As a proof of concept ...
Jiewen Huang, Lyublena Antova, Christoph Koch, Dan...
PODS
1999
ACM
151views Database» more  PODS 1999»
14 years 1 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 9 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola