Sciweavers

151 search results - page 1 / 31
» Rearranging data objects for efficient and stable clustering
Sort
View
SAC
2005
ACM
13 years 10 months ago
Rearranging data objects for efficient and stable clustering
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
Gyesung Lee, Xindong Wu, Jinho Chon
JMLR
2006
96views more  JMLR 2006»
13 years 4 months ago
Rearrangement Clustering: Pitfalls, Remedies, and Applications
Given a matrix of values in which the rows correspond to objects and the columns correspond to features of the objects, rearrangement clustering is the problem of rearranging the ...
Sharlee Climer, Weixiong Zhang
TCSV
2010
12 years 11 months ago
Video Foreground Detection Based on Symmetric Alpha-Stable Mixture Models
Background subtraction (BS) is an efficient technique for detecting moving objects in video sequences. A simple BS process involves building a model of the background and extractin...
Harish Bhaskar, Lyudmila Mihaylova, Alin Achim
ASAP
2000
IEEE
90views Hardware» more  ASAP 2000»
13 years 9 months ago
Subword Permutation Instructions for Two-Dimensional Multimedia Processing in MicroSIMD Architectures
MicroSIMD architectures incorporating subword parallelism are very efficient for application-specific media processors as well as for fast multimedia information processing in gen...
Ruby B. Lee
HPCC
2007
Springer
13 years 11 months ago
Maximum-Objective-Trust Clustering Solution and Analysis in Mobile Ad Hoc Networks
In mobile-AdHoc networks (MANETs), many applications need the support of layer-structure. Clustering solution is the most widely used layerstructure and the choosing of clusterhead...
Qiang Zhang, Guangming Hu, Zhenghu Gong