331 search results - page 21 / 67 » Fast Matching for All Pairs Similarity Search |
ICCD
2001
IEEE
15 years 6 months ago
2001
IEEE
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
The recognition of text in everyday scenes is made difficult by viewing conditions, unusual fonts, and lack of linguistic context. Most methods integrate a priori appearance info...
IBIS
2006
14 years 9 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
120
click to vote
IS
2011
14 years 4 months ago
2011
—It is common for large and complex organizations to maintain repositories of business process models in order to document and to continuously improve their operations. Given suc...