Sciweavers

976 search results - page 62 / 196
» The Complexity of Timetable Construction Problems
Sort
View
ESORICS
2006
Springer
14 years 23 days ago
Secure Key-Updating for Lazy Revocation
Abstract. We consider the problem of efficient key management and user revocation in cryptographic file systems that allow shared access to files. A performanceefficient solution t...
Michael Backes, Christian Cachin, Alina Oprea
EUROCRYPT
2010
Springer
14 years 1 months ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
AUSDM
2008
Springer
211views Data Mining» more  AUSDM 2008»
13 years 11 months ago
LBR-Meta: An Efficient Algorithm for Lazy Bayesian Rules
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
Zhipeng Xie
ISAAC
2005
Springer
98views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Casting an Object with a Core
This paper addresses geometric problems that concern manufacturing an object using a cast with a core. In casting, molten material is poured into the cavity of the cast and allowe...
Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Y...
WOSP
2000
ACM
14 years 1 months ago
How system architectures impede interoperability
Interoperability problems arise when complex software systems are constructed by integrating distinct, and often heterogeneous, components. By performing interoperability analysis...
Leigh A. Davis, Jamie Payton, Rose F. Gamble