14518 search results - page 271 / 2904 » Two Problems for Sophistication |
251
click to vote
VLDB
2002
ACM
16 years 5 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
142
click to vote
CRYPTO
2009
Springer
16 years 6 days ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
142
click to vote
FSTTCS
2009
Springer
16 years 5 days ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
137
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
We review recent work on the Hierarchical-If-And-Only-If problem and present a new hierarchical problem, HIFF-M that does not fit with previous explanations for evolutionary diffi...
132
Voted
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
In the well-studied Majority problem, we are given a set of n balls colored with two or more colors, and the goal is to use the minimum number of color comparisons to find a ball ...