Sciweavers

25041 search results - page 4465 / 5009
» Algorithms for Clustering Data
Sort
View
WWW
2001
ACM
16 years 7 months ago
Batch rekeying for secure group communications
Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph app...
Xiaozhou (Steve) Li, Yang Richard Yang, Mohamed G....
CP
2009
Springer
16 years 7 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...
ESORICS
2009
Springer
16 years 7 months ago
Attribute-Sets: A Practically Motivated Enhancement to Attribute-Based Encryption
In distributed systems users need to share sensitive objects with others based on the recipients' ability to satisfy a policy. Attribute-Based Encryption (ABE) is a new parad...
Rakeshbabu Bobba, Himanshu Khurana, Manoj Prabhaka...
EUROCRYPT
2009
Springer
16 years 7 months ago
Order-Preserving Symmetric Encryption
We initiate the cryptographic study of order-preserving symmetric encryption (OPE), a primitive suggested in the database community by Agrawal et al. (SIGMOD '04) for allowin...
Alexandra Boldyreva, Nathan Chenette, Younho Lee, ...
193
Voted
PPOPP
2009
ACM
16 years 7 months ago
How much parallelism is there in irregular applications?
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
Milind Kulkarni, Martin Burtscher, Rajeshkar Inkul...
« Prev « First page 4465 / 5009 Last » Next »