2475 search results - page 451 / 495 » Question Answering in TREC |
COCO
2009
Springer
15 years 6 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
105
click to vote
COCO
2009
Springer
15 years 6 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
103
click to vote
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
100
click to vote
REFSQ
2009
Springer
15 years 6 months ago
2009
Springer
[Context and motivation] In market-driven product development of software intensive products large numbers of requirements threaten to overload the development organization. It is ...