Sciweavers

4541 search results - page 429 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
16 years 6 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
15 years 11 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
15 years 11 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
131
Voted
BIBE
2003
IEEE
116views Bioinformatics» more  BIBE 2003»
15 years 10 months ago
An Assessment of a Metric Space Database Index to Support Sequence Homology
Hierarchical metric-space clustering methods have been commonly used to organize proteomes into taxonomies. Consequently, it is often anticipated that hierarchical clustering can ...
Rui Mao, Weijia Xu, Neha Singh, Daniel P. Miranker
WWW
2006
ACM
16 years 5 months ago
Interactive wrapper generation with minimal user effort
While much of the data on the web is unstructured in nature, there is also a significant amount of embedded structured data, such as product information on e-commerce sites or sto...
Utku Irmak, Torsten Suel