Sciweavers

440 search results - page 39 / 88
» Comparison of Galled Trees
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 1 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
MOBIQUITOUS
2008
IEEE
14 years 3 months ago
How to edit gigabyte XML files on a mobile phone with XAS, RefTrees, and RAXS
The Open Source mobility middleware developed in the Fuego Core project provides a stack for efficient XML processing on limited devices. Its components are a persistent map API, ...
Tancred Lindholm, Jaakko Kangasharju
PVLDB
2010
150views more  PVLDB 2010»
13 years 7 months ago
Tree Indexing on Solid State Drives
Large flash disks, or solid state drives (SSDs), have become an attractive alternative to magnetic hard disks, due to their high random read performance, low energy consumption a...
Yinan Li, Bingsheng He, Jun Yang 0001, Qiong Luo, ...
PAMI
2011
13 years 3 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
ICDE
2009
IEEE
152views Database» more  ICDE 2009»
14 years 10 months ago
Tree Indexing on Flash Disks
Abstract-- Large flash disks have become an attractive alternative to magnetic hard disks, due to their high random read performance, low energy consumption and other features. How...
Yinan Li, Bingsheng He, Qiong Luo, Ke Yi