Sciweavers

32545 search results - page 556 / 6509
» Data Structures and Algorithms
Sort
View
CPM
2001
Springer
130views Combinatorics» more  CPM 2001»
15 years 11 months ago
On-Line Construction of Compact Directed Acyclic Word Graphs
Directed Acyclic Word Graph (DAWG) is a space efficient data structure that supports indices of a string. Compact Directed Acyclic Word Graph (CDAWG) is a more space efficient vari...
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohar...
ICDAR
1999
IEEE
15 years 11 months ago
Combining Classifiers based on Confidence Values
This paper describes our investigation into the neural gas (NG) network algorithm and the hierarchical overlapped architecture (HONG) which we have built by retaining the essence ...
Ajantha S. Atukorale, Ponnuthurai N. Suganthan
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
16 years 8 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
CIKM
2009
Springer
16 years 1 months ago
Towards non-directional Xpath evaluation in a RDBMS
XML query languages use directional path expressions to locate data in an XML data collection. They are tightly coupled to the structure of a data collection, and can fail when ev...
Sourav S. Bhowmick, Curtis E. Dyreson, Erwin Leona...
ICPR
2008
IEEE
16 years 1 months ago
Semi-supervised marginal discriminant analysis based on QR decomposition
In this paper, a novel subspace learning method, semi-supervised marginal discriminant analysis (SMDA), is proposed for classification. SMDA aims at maintaining the intrinsic neig...
Rui Xiao, Pengfei Shi