Sciweavers

569 search results - page 46 / 114
» An efficient clustering method for k-anonymization
Sort
View
CORR
2004
Springer
218views Education» more  CORR 2004»
13 years 8 months ago
A Dynamic Clustering-Based Markov Model for Web Usage Mining
Markov models have been widely utilized for modelling user web navigation behaviour. In this work we propose a dynamic clustering-based method to increase a Markov model's ac...
José Borges, Mark Levene
ITIIS
2010
151views more  ITIIS 2010»
13 years 7 months ago
Practical Data Transmission in Cluster-Based Sensor Networks
Data routing in wireless sensor networks must be energy-efficient because tiny sensor nodes have limited power. A cluster-based hierarchical routing is known to be more efficient ...
Dae Young Kim, Jinsung Cho, Byeong-Soo Jeong
IJCV
2008
157views more  IJCV 2008»
13 years 8 months ago
Pairwise Matching of 3D Fragments Using Cluster Trees
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
Simon Winkelbach, Friedrich M. Wahl
RT
2000
Springer
14 years 7 days ago
Guaranteed Occlusion and Visibility in Cluster Hierarchical Radiosity
Visibility determination is the most expensive task in cluster hierarchical radiosity. Guaranteed full occlusion and full visibility can reduce these computations without causing ...
Luc Leblanc, Pierre Poulin
AAAI
2008
13 years 11 months ago
Visualization of Large-Scale Weighted Clustered Graph: A Genetic Approach
In this paper, a bottom-up hierarchical genetic algorithm is proposed to visualize clustered data into a planar graph. To achieve global optimization by accelerating local optimiz...
Jiayu Zhou, Youfang Lin, Xi Wang