Sciweavers

57 search results - page 9 / 12
» Faster algorithms for guided tree edit distance
Sort
View
ISM
2008
IEEE
83views Multimedia» more  ISM 2008»
15 years 3 months ago
Fast and Flexible Tree Rendering with Enhanced Visibility Estimation
We present a set of techniques to simplify tree models for faster rendering while retaining their visual resemblance to the original model. This goal is achieved by setting a budg...
Jessy Lee, C. C. Jay Kuo
JUCS
2008
185views more  JUCS 2008»
14 years 9 months ago
Recognising Informative Web Page Blocks Using Visual Segmentation for Efficient Information Extraction
Abstract: As web sites are getting more complicated, the construction of web information extraction systems becomes more troublesome and time-consuming. A common theme is the diffi...
Jinbeom Kang, Joongmin Choi
CANDC
2005
ACM
14 years 9 months ago
MSAID: multiple sequence alignment based on a measure of information discrepancy
We propose an algorithm of global multiple sequence alignment that is based on a measure of what we call information discrepancy. The algorithm follows a progressive alignment ite...
Min Zhang, Weiwu Fang, Junhua Zhang, Zhongxian Chi
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
15 years 3 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
IJCAI
2003
14 years 11 months ago
Employing Trainable String Similarity Metrics for Information Integration
The problem of identifying approximately duplicate objects in databases is an essential step for the information integration process. Most existing approaches have relied on gener...
Mikhail Bilenko, Raymond J. Mooney