118 search results - page 21 / 24 » Permutation codes |
STOC
2004
ACM
14 years 11 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
—The capacity region of the finite-state multiple-access channel (FS-MAC) with feedback that may be an arbitrary timeinvariant function of the channel output samples is consider...
FOCS
2007
IEEE
14 years 5 months ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
CVPR
2001
IEEE
15 years 26 days ago
2001
IEEE
The FERET evaluation compared recognition rates for different semi-automated and automated face recognition algorithms. We extend FERET by considering when differences in recognit...
EMSOFT
2007
Springer
14 years 5 months ago
2007
Springer
E-FRP is declarative language for programming resourcebounded, event-driven systems. The original high-level semantics of E-FRP requires that each event handler execute atomically...