42230 search results - page 269 / 8446 » Algorithms and Complexity Results for |
179
click to vote
SIGIR
2005
ACM
16 years 6 days ago
2005
ACM
We report on two experiments performed to test the importance of Term Order in automatic summarisation. Experiment one was undertaken as part of DUC 2004 to which three systems we...
167
click to vote
COMPGEOM
1999
ACM
15 years 11 months ago
1999
ACM
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
164
click to vote
IPCO
1998
15 years 8 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
171
click to vote
MP
2006
15 years 6 months ago
2006
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
172
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
Search result diversification is a natural approach for tackling ambiguous queries. Nevertheless, not all queries are equally ambiguous, and hence different queries could bene...