Sciweavers

5214 search results - page 26 / 1043
» The Online Specialization Problem
Sort
View
FC
2004
Springer
129views Cryptology» more  FC 2004»
14 years 28 days ago
A Privacy-Friendly Loyalty System Based on Discrete Logarithms over Elliptic Curves
Abstract. Systems for the support of customer relationship management are becoming increasingly attractive for vendors. Loyalty systems provide an interesting possibility for vendo...
Matthias Enzmann, Marc Fischlin, Markus Schneider ...
CTRSA
2009
Springer
112views Cryptology» more  CTRSA 2009»
13 years 11 months ago
Divisible On-Line/Off-Line Signatures
On-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 pro...
Chong-zhi Gao, Baodian Wei, Dongqing Xie, Chunming...
IWPEC
2004
Springer
14 years 28 days ago
Online Problems, Pathwidth, and Persistence
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
Rodney G. Downey, Catherine McCartin
ALGORITHMICA
2002
73views more  ALGORITHMICA 2002»
13 years 7 months ago
Randomized Weighted Caching with Two Page Weights
We consider a special case of the weighted caching problem where
Sandy Irani
TCS
2008
13 years 7 months ago
Online unit clustering: Variations on a theme
Online unit clustering is a clustering problem where classification of points is done in an online fashion, but the exact location of clusters can be modified dynamically. We stud...
Leah Epstein, Asaf Levin, Rob van Stee