Sciweavers

415 search results - page 18 / 83
» Optimally Reconstructing Weighted Graphs Using Queries
Sort
View
SIGIR
2008
ACM
13 years 9 months ago
Re-ranking search results using document-passage graphs
We present a novel passage-based approach to re-ranking documents in an initially retrieved list so as to improve precision at top ranks. While most work on passage-based document...
Michael Bendersky, Oren Kurland
WWW
2010
ACM
14 years 4 months ago
Optimal rare query suggestion with implicit user feedback
Query suggestion has been an effective approach to help users narrow down to the information they need. However, most of existing studies focused on only popular/head queries. Si...
Yang Song, Li-wei He
NIPS
2003
13 years 10 months ago
Salient Boundary Detection using Ratio Contour
This paper presents a novel graph-theoretic approach, named ratio contour, to extract perceptually salient boundaries from a set of noisy boundary fragments detected in real image...
Song Wang, Toshiro Kubota, Jeffrey Mark Siskind
NIPS
2007
13 years 10 months ago
Linear programming analysis of loopy belief propagation for weighted matching
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investiga...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
CASES
2009
ACM
14 years 3 months ago
Optimal loop parallelization for maximizing iteration-level parallelism
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
Duo Liu, Zili Shao, Meng Wang, Minyi Guo, Jingling...