204 search results - page 4 / 41 » A Half-Million Strong at Least |
CODCRY
2009
Springer
13 years 11 months ago
2009
Springer
We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second on...
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
– Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of crossbar scheduling algorithms that provide strong performance...
LICS
2007
IEEE
13 years 11 months ago
2007
IEEE
When enriching the λ-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (∨ E) of union typ...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
DISOPT
2007
13 years 4 months ago
2007
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....