Sciweavers

2969 search results - page 364 / 594
» A space efficient algorithm for group structure computation
Sort
View
ICDE
2004
IEEE
138views Database» more  ICDE 2004»
16 years 6 months ago
Making the Pyramid Technique Robust to Query Types and Workloads
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...
Rui Zhang 0003, Beng Chin Ooi, Kian-Lee Tan
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...
ACL
2009
15 years 2 months ago
A Novel Discourse Parser Based on Support Vector Machine Classification
This paper introduces a new algorithm to parse discourse within the framework of Rhetorical Structure Theory (RST). Our method is based on recent advances in the field of statisti...
David duVerle, Helmut Prendinger
CIKM
2010
Springer
15 years 2 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 9 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh