This paper describes an intelligent agent to facilitate bitext mining from the Web via automatic discovery of URL pairing patterns (or keys) for retrieving parallel web pages. The...
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...
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...
To be reversible as a data hiding method, the original content and hidden message should be completely recovered. One important objective of this approach is to achieve high embed...
Hee Joon Hwang, Hyoung Joong Kim, Vasiliy Sachnev,...