Sciweavers

656 search results - page 108 / 132
» Large-Graph Layout Algorithms at Work: An Experimental Study
Sort
View
SAC
2004
ACM
15 years 3 months ago
Forest trees for on-line data
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
João Gama, Pedro Medas, Ricardo Rocha
KDD
2009
ACM
232views Data Mining» more  KDD 2009»
15 years 2 months ago
Probabilistic latent semantic user segmentation for behavioral targeted advertising
Behavioral Targeting (BT), which aims to deliver the most appropriate advertisements to the most appropriate users, is attracting much attention in online advertising market. A ke...
Xiaohui Wu, Jun Yan, Ning Liu, Shuicheng Yan, Ying...
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 1 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
TASE
2008
IEEE
14 years 9 months ago
Steady-State Throughput and Scheduling Analysis of Multicluster Tools: A Decomposition Approach
Abstract--Cluster tools are widely used as semiconductor manufacturing equipment. While throughput analysis and scheduling of single-cluster tools have been well-studied, research ...
Jingang Yi, Shengwei Ding, Dezhen Song, Mike Tao Z...
KDD
2012
ACM
202views Data Mining» more  KDD 2012»
13 years 2 days ago
UFIMT: an uncertain frequent itemset mining toolbox
In recent years, mining frequent itemsets over uncertain data has attracted much attention in the data mining community. Unlike the corresponding problem in deterministic data, th...
Yongxin Tong, Lei Chen 0002, Philip S. Yu