3172 search results - page 159 / 635 » On the Random-Self-Reducibility of Complete Sets |
154
click to vote
SIGMOD
1999
ACM
15 years 10 months ago
1999
ACM
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...
170
click to vote
IGPL
1998
15 years 6 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
174
click to vote
FUIN
2010
15 years 5 months ago
2010
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...
171
click to vote
JCT
2010
15 years 4 months ago
2010
An Avoider-Enforcer game is played by two players, called Avoider and Enforcer, on a hypergraph F ⊆ 2X . The players claim previously unoccupied elements of the board X in turns...
176
click to vote
JORS
2010
15 years 1 months ago
2010
In order to manage model risk, financial institutions need to set up validation processes so as to monitor the quality of the models on an ongoing basis. Validation can be conside...