681 search results - page 122 / 137 » General Polynomial Time Decomposition Algorithms |
COMPGEOM
2009
ACM
14 years 4 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
CRYPTO
2003
Springer
14 years 3 months ago
2003
Springer
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
FC
1998
Springer
14 years 2 months ago
1998
Springer
Emerging electronic commerce services that use public-key cryptography on a mass-market scale require sophisticated mechanisms for managing trust. For example, any service that rec...
CCS
2006
ACM
14 years 1 months ago
2006
ACM
We introduce the notion of resiliency policies in the context of access control systems. Such policies require an access control system to be resilient to the absence of users. An...
AAAI
1997
13 years 11 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...