Sciweavers

EDBT
2011
ACM
199views Database» more  EDBT 2011»
13 years 2 months ago
Finding closed frequent item sets by intersecting transactions
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...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
ICIP
2010
IEEE
13 years 8 months ago
Morphological wavelet transform with adaptive dyadic structures
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 ...
Zhen James Xiang, Peter J. Ramadge
PR
2010
160views more  PR 2010»
13 years 9 months ago
Homeomorphic alignment of weighted trees
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...
Benjamin Raynal, Michel Couprie, Venceslas Biri
AAAI
1990
14 years 2 days ago
Tree Decomposition with Applications to Constraint Processing
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...
Itay Meiri, Judea Pearl, Rina Dechter
DAS
2006
Springer
14 years 2 months ago
Structural Analysis of Mathematical Formulae with Verification Based on Formula Description Grammar
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...
Seiichi Toyota, Seiichi Uchida, Masakazu Suzuki
ISCAS
2005
IEEE
136views Hardware» more  ISCAS 2005»
14 years 4 months ago
Economical passive filter synthesis using genetic programming based on tree representation
—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...
Hao-Sheng Hou, Shoou-Jinn Chang, Yan-Kuin Su