1951 search results - page 211 / 391 » An algorithm for improving graph partitions |
149
Voted
SIGIR
2008
ACM
15 years 5 months ago
2008
ACM
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...
176
click to vote
WWW
2003
ACM
16 years 6 months ago
2003
ACM
Recent advances in information retrieval over hyperlinked corpora have convincinglydemonstratedthat links carry less noisy information than text. We investigate the feasibility of...
164
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
190
Voted
ATVA
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
170
click to vote
ACL
2008
15 years 7 months ago
2008
In statistical language modeling, one technique to reduce the problematic effects of data sparsity is to partition the vocabulary into equivalence classes. In this paper we invest...