2434 search results - page 341 / 487 » Algorithmic Randomness of Closed Sets |
131
Voted
EMO
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. The classic NFL theorems are invariably cast in terms of single objective optimization problems. We confirm that the classic NFL theorem holds for general multiobjective ...
142
Voted
ASIACRYPT
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We study two closely related primitives: Broadcast Encryption and Key Predistribution Schemes (KPS). Broadcast Encryption allows a broadcaster to broadcast an encrypted m...
137
Voted
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
117
click to vote
NOSSDAV
2010
Springer
15 years 7 months ago
2010
Springer
Subjective quality perception studies with human observers are essential for multimedia system design. Such studies are known to be expensive and difficult to administer. They req...
122
Voted
IANDC
2010
15 years 2 months ago
2010
For two naturals m, n such that m < n, we show how to construct a circuit C with m inputs and n outputs, that has the following property: for some 0 ≤ k ≤ m, the circuit deï...