1346 search results - page 72 / 270 » On the number of rectangular partitions |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Entity matching is an important and difficult step for integrating web data. To reduce the typically high execution time for matching we investigate how we can perform entity matc...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
As a key part of universal source coding, context quantization is very important for improving compression performance. However, in most existing methods, the quantizer is trained...
SMI
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper we propose a novel algorithm for 3D shape searching based on the visual similarity by cutting the object into sections. This method rectifies some of the shortcomin...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we present a tree-partition algorithm for parallel mining of frequent patterns. Our work is based on FP-Growth algorithm, which is constituted of tree-building stag...
ICPPW
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— In the sporadic task model, a task is characterized by three parameters — an execution requirement, a relative deadline, and a period parameter — and has the interp...