3991 search results - page 119 / 799 » Bounding homogeneous models |
FOCS
1998
IEEE
14 years 9 days ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
ASIACRYPT
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
NIPS
2007
13 years 9 months ago
2007
In this paper, we show that classical survival analysis involving censored data can naturally be cast as a ranking problem. The concordance index (CI), which quantifies the quali...
HEURISTICS
2008
13 years 6 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
VMCAI
2010
Springer
14 years 5 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...