Sciweavers

901 search results - page 114 / 181
» On Anonymization of String Data
Sort
View
VLDB
2007
ACM
159views Database» more  VLDB 2007»
16 years 1 months ago
Example-driven design of efficient record matching queries
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti...
CSE
2009
IEEE
15 years 8 months ago
Bio-chaotic Stream Cipher-Based Iris Image Encryption
Conventional cryptography uses encryption key, which are long bit strings and are very hard to memorize such a long random numbers. Also it can be easily attacked by using the brut...
Abdullah Sharaf Alghamdi, Hanif Ullah, Maqsood Mah...
CEC
2008
IEEE
15 years 8 months ago
Fast symmetric keys generation via mutual mirroring process
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
Chun-Shun Tseng, Ya-Yun Jheng, Sih-Yin Shen, Jung-...
ICPR
2008
IEEE
15 years 8 months ago
Indexing and retrieving cursive documents without recognition
A large amount of handwritten documents exist in image form, as scanned documents. The supporting electronic media allows for better preservation, but to access their content they...
Antonio Clavelli, Luigi P. Cordella, Claudio De St...
MICAI
2007
Springer
15 years 7 months ago
Variants of Tree Kernels for XML Documents
In this paper, we discuss tree kernels that can be applied for the classification of XML documents based on their DOM trees. DOM trees are ordered trees, in which every node might...
Peter Geibel, Helmar Gust, Kai-Uwe Kühnberger