Yossi Shiloach
- 1 AHO, A.V., HOPCROFT, J.E., AND ULLMAN, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974. Google Scholar
- 2 CHESTON, G.A. Incremental algorithms in graph theory. Ph.D. Diss., Dep. of Computer Science, Univ. of Toronto, March 1976 (Tech. Rep. No. 91). Google Scholar
- 3 KARP, R.M. Private communication.Google Scholar
- 4 TARJAN, R.E. Efficiency of a good but not linear set union algorithm. J. A CM 22, 2 (April 1975), 215-225. Google Scholar
Index Terms
- An On-Line Edge-Deletion Problem
Recommendations
Divisible On-Line/Off-Line Signatures
CT-RSA '09: Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in CryptologyOn-line/Off-line signatures are used in a particular scenario where the signer must respond quickly once the message to be signed is presented. The idea is to split the signing procedure into two phases: the off-line and on-line phases. The signer can ...
On-line versus off-line accelerated kernel feature analysis: Application to computer-aided detection of polyps in CT colonography
A semi-supervised learning method, the on-line accelerated kernel feature analysis (On-line AKFA) is presented. In On-line AKFA, features are extracted while data are being fed to the algorithm in small batches as the algorithm proceeds. The paper ...
Is the Notion of Divisible On-Line/Off-Line Signatures Stronger than On-Line/Off-Line Signatures?
ProvSec '09: Proceedings of the 3rd International Conference on Provable SecurityOn-line/Off-line signatures are useful in many applications where the signer has a very limited response time once the message is presented. The idea is to perform the signing process in two phases. The first phase is performed <em>off-line</em> before ...
Comments