1089 search results - page 77 / 218 » Bounds on generalized Frobenius numbers |
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
ASIACRYPT
2000
Springer
14 years 1 months ago
2000
Springer
Block ciphers are usually based on one top-level scheme into which we plug “round functions”. To analyze security, it is important to study the intrinsic security provided by t...
AII
1992
14 years 1 months ago
1992
Most theoretical models of inductive inference make the idealized assumption that the data available to a learner is from a single and accurate source. The subject of inaccuracies ...
ICDT
2009
ACM
14 years 9 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
JCT
2011
13 years 4 months ago
2011
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....