Sciweavers

7106 search results - page 807 / 1422
» Restricted Complexity, General Complexity
Sort
View
EUROCRYPT
2010
Springer
16 years 1 days 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
CSMR
2009
IEEE
15 years 12 months ago
A Method for Choosing Software Assessment Measures Using Bayesian Networks and Diagnosis
Creating accurate models of information systems is an important but challenging task. It is generally well understood that such modeling encompasses general scientific issues, bu...
Ulrik Franke, Pontus Johnson, Robert Lagerströ...
206
Voted
COMPGEOM
2009
ACM
15 years 12 months ago
k-means requires exponentially many iterations even in the plane
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Andrea Vattani
197
Voted
CIKM
2009
Springer
15 years 12 months ago
Density-based clustering using graphics processors
During the last few years, GPUs have evolved from simple devices for the display signal preparation into powerful coprocessors that do not only support typical computer graphics t...
Christian Böhm, Robert Noll, Claudia Plant, B...
177
Voted
GPCE
2009
Springer
15 years 12 months ago
Safe composition of non-monotonic features
Programs can be composed from features. We want to verify automatically that all legal combinations of features can be composed safely without errors. Prior work on this problem a...
Martin Kuhlemann, Don S. Batory, Christian Kä...