1068 search results - page 34 / 214 » On Space Bounded Server Algorithms |
JMLR
2006
13 years 7 months ago
2006
We determine the asymptotic behaviour of the function computed by support vector machines (SVM) and related algorithms that minimize a regularized empirical convex loss function i...
ASPLOS
2008
ACM
13 years 9 months ago
2008
ACM
Memory errors are a notorious source of security vulnerabilities that can lead to service interruptions, information leakage and unauthorized access. Because such errors are also ...
ALGORITHMICA
2010
13 years 7 months ago
2010
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...