Sciweavers

1679 search results - page 101 / 336
» Strong order equivalence
Sort
View
STOC
1987
ACM
82views Algorithms» more  STOC 1987»
14 years 1 months ago
Permutation Groups in NC
We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...
László Babai, Eugene M. Luks, &Aacut...
EUROPKI
2008
Springer
13 years 11 months ago
Efficient Generic Forward-Secure Signatures and Proxy Signatures
We propose a generic method to construct forward-secure signature schemes from standard signature schemes. The proposed construction is more computationally efficient than previous...
Basel Alomair, Krishna Sampigethaya, Radha Poovend...
JUCS
2007
88views more  JUCS 2007»
13 years 10 months ago
Internet Payment System: A New Payment System for Internet Transactions
: Payment systems need to address a number of security issues in order to be an effective and secure means of transferring payments across the Internet. To be accessible to a wider...
Zoran Djuric, Ognjen Maric, Dragan Gasevic
ML
2002
ACM
145views Machine Learning» more  ML 2002»
13 years 9 months ago
Boosting Methods for Regression
In this paper we examine ensemble methods for regression that leverage or "boost" base regressors by iteratively calling them on modified samples. The most successful lev...
Nigel Duffy, David P. Helmbold
ICCV
2009
IEEE
13 years 7 months ago
Kernel map compression using generalized radial basis functions
The use of Mercer kernel methods in statistical learning theory provides for strong learning capabilities, as seen in kernel principal component analysis and support vector machin...
Omar Arif, Patricio A. Vela