1191 search results - page 125 / 239 » Completeness and Performance Of The APO Algorithm |
COMPSEC
1998
14 years 9 months ago
1998
This paper describes a data mixing method for encrypting a plaintext block using a block encryption algorithm (such as Elliptic Curve, RSA, etc.) having a block size smaller than ...
PRL
2007
14 years 9 months ago
2007
Several computer vision problems, like segmentation, tracking and shape modeling, are increasingly being solved using level set methodologies. But the critical issues of stability...
KDD
2000
ACM
15 years 1 months ago
2000
ACM
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
DAC
2001
ACM
15 years 11 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
DAC
2004
ACM
15 years 11 months ago
2004
ACM
ion of Assembler Programs for Symbolic Worst Case Execution Time Analysis Tobias Schuele Tobias.Schuele@informatik.uni-kl.de Klaus Schneider Klaus.Schneider@informatik.uni-kl.de Re...