361 search results - page 2 / 73 » Finding Optimal Pairs of Patterns |
IAT
2007
IEEE
13 years 11 months ago
2007
IEEE
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...
SDM
2003
SIAM
13 years 6 months ago
2003
SIAM
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...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
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...
EM
2010
13 years 5 days ago
2010
Given fixed 0 = q0 < q1 < q2 <
ITIIS
2010
2010
Reversible Watermarking Method Using Optimal Histogram Pair Shifting Based on Prediction and Sorting
13 years 3 months ago
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...