Sciweavers

1798 search results - page 116 / 360
» A Tree for All Seasons
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 2 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
IDEAL
2009
Springer
14 years 1 months ago
Web Feed Clustering and Tagging Aggregator Using Topological Tree-Based Self-Organizing Maps
With the rapid and dramatic increase in web feeds published by different publishers, providers or websites via Really Simple Syndication (RSS) and Atom, users cannot be expected t...
Richard T. Freeman
SPAA
1996
ACM
14 years 1 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
VVS
1995
IEEE
132views Visualization» more  VVS 1995»
14 years 16 days ago
Multi-Dimensional Trees for Controlled Volume Rendering and Compression
This paper explores the use of multi-dimensional trees to provide spatial and temporal e ciencies in imaging large data sets. Each node of the tree contains a model of the data in...
Jane Wilhelms, Allen Van Gelder
ACMSE
2006
ACM
13 years 11 months ago
Phoenix-based clone detection using suffix trees
A code clone represents a sequence of statements that are duplicated in multiple locations of a program. Clones often arise in source code as a result of multiple cut/paste operat...
Robert Tairas, Jeff Gray