Sciweavers

2735 search results - page 204 / 547
» Comparing notions of randomness
Sort
View
82
Voted
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
15 years 5 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
117
Voted
ASIACRYPT
2010
Springer
14 years 10 months ago
A Closer Look at Anonymity and Robustness in Encryption Schemes
Abstract. In this work, we take a closer look at anonymity and robustness in encryption schemes. Roughly speaking, an anonymous encryption scheme hides the identity of the secret-k...
Payman Mohassel
PAKDD
2011
ACM
419views Data Mining» more  PAKDD 2011»
14 years 3 months ago
DISC: Data-Intensive Similarity Measure for Categorical Data
Abstract. The concept of similarity is fundamentally important in almost every scientific field. Clustering, distance-based outlier detection, classification, regression and sea...
Aditya Desai, Himanshu Singh, Vikram Pudi
195
Voted
ICDE
2006
IEEE
161views Database» more  ICDE 2006»
16 years 2 months ago
A Primitive Operator for Similarity Joins in Data Cleaning
Data cleaning based on similarities involves identification of "close" tuples, where closeness is evaluated using a variety of similarity functions chosen to suit the do...
Surajit Chaudhuri, Venkatesh Ganti, Raghav Kaushik
85
Voted
ICIP
2009
IEEE
16 years 1 months ago
Natural Image Utility Assessment Using Image Contours
In the quality assessment task, observers evaluate a natural image based on its perceptual resemblance to a reference. For the utility assessment task, observers evaluate the usef...