5595 search results - page 1040 / 1119 » Comparing Subsumption Optimizations |
130
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
97
Voted
CRYPTO
2009
Springer
15 years 9 months ago
2009
Springer
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
125
Voted
FSTTCS
2009
Springer
15 years 9 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) ...
132
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ...
151
Voted
ICCS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...