Sciweavers

3495 search results - page 244 / 699
» On the random satisfiable process
Sort
View
EUROCRYPT
2004
Springer
16 years 19 days ago
Chosen-Ciphertext Security from Identity-Based Encryption
Abstract. We propose a simple and efficient construction of a CCAsecure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our construction re...
Ran Canetti, Shai Halevi, Jonathan Katz
ICDM
2003
IEEE
240views Data Mining» more  ICDM 2003»
16 years 15 days ago
Clustering of Time Series Subsequences is Meaningless: Implications for Previous and Future Research
Given the recent explosion of interest in streaming data and online algorithms, clustering of time series subsequences, extracted via a sliding window, has received much attention...
Eamonn J. Keogh, Jessica Lin, Wagner Truppel
ISCAS
2003
IEEE
114views Hardware» more  ISCAS 2003»
16 years 15 days ago
On the hardware implementations of the SHA-2 (256, 384, 512) hash functions
Couple to the communications wired and unwired networks growth, is the increasing demand for strong secure data transmission. New cryptographic standards are developed, and new en...
Nicolas Sklavos, Odysseas G. Koufopavlou
AI
2003
Springer
16 years 14 days ago
Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
Dan C. Tulpan, Holger H. Hoos
COLT
2003
Springer
16 years 14 days ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan