2485 search results - page 327 / 497 » Time Bounded Frequency Computations |
TCC
2010
Springer
14 years 5 months ago
2010
Springer
The strongest standard security notion for digital signature schemes is unforgeability under chosen message attacks. In practice, however, this notion can be insufficient due to â€...
WEA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
SOFSEM
2010
Springer
14 years 5 months ago
2010
Springer
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
NCA
2009
IEEE
14 years 2 months ago
2009
IEEE
—It has been observed in recent years that in many applications service time demands are highly variable. Without foreknowledge of exact service times of individual jobs, process...