Sciweavers

3362 search results - page 121 / 673
» A definition of subjective possibility
Sort
View
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
15 years 7 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
CCS
2010
ACM
15 years 6 months ago
On the soundness of authenticate-then-encrypt: formalizing the malleability of symmetric encryption
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...
Ueli Maurer, Björn Tackmann
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 6 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
BMCBI
2007
151views more  BMCBI 2007»
15 years 6 months ago
The Genopolis Microarray Database
Background: Gene expression databases are key resources for microarray data management and analysis and the importance of a proper annotation of their content is well understood. ...
Andrea Splendiani, Marco Brandizi, Gael Even, Otta...
SPAA
2009
ACM
16 years 7 months ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...