EDBT
2011
ACM
12 years 8 months ago
2011
ACM
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
ICIP
2010
IEEE
13 years 1 months ago
2010
IEEE
We propose a two component method for denoising multidimensional signals, e.g. images. The first component uses a dynamic programing algorithm of complexity O(N log N) to find an ...
PR
2010
13 years 2 months ago
2010
Motion capture, a currently active research area, needs estimation of the pose of the subject. For this purpose, we match the tree representation of the skeleton of the 3D shape t...
AAAI
1990
13 years 5 months ago
1990
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
DAS
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, a reliable and efficient structural analysis method for mathematical formulae is proposed for practical mathematical OCR. The proposed method consists of three steps...
ISCAS
2005
IEEE
13 years 10 months ago
2005
IEEE
—In this work we propose a novel tree representation for RLC circuits. Genetic programming based on the tree representation is described and applied to passive filter synthesis p...