498 search results - page 9 / 100 » Estimating Robust Query Models with Convex Optimization |
TREC
2003
13 years 9 months ago
2003
In this paper, we report our experiments in the TREC 2003 Genomics Track and the Robust Track. A common theme that we explored is the robustness of a basic language modeling retri...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
ECIR
2008
Springer
13 years 9 months ago
2008
Springer
In document retrieval using pseudo relevance feedback, after initial ranking, a fixed number of top-ranked documents are selected as feedback to build a new expansion query model. ...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, a new algorithm for robust adaptive beamforming is developed. The basic idea of the proposed algorithm is to estimate the difference between the actual and presumed...
ICDE
2001
IEEE
14 years 9 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...