Sciweavers

1385 search results - page 51 / 277
» Clustering by Random Projections
Sort
View
MICS
2010
134views more  MICS 2010»
14 years 10 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
CVPR
2011
IEEE
14 years 7 months ago
Random Field Topic Model for Semantic Region Analysis in Crowded Scenes from Tracklets
In this paper, a Random Field Topic (RFT) model is proposed for semantic region analysis from motions of objects in crowded scenes. Different from existing approaches of learning ...
Bolei Zhou, Xiaogang Wang
IPTPS
2005
Springer
15 years 5 months ago
Hybrid Overlay Structure Based on Random Walks
Application-level multicast on structured overlays often suffer several drawbacks: 1) The regularity of the architecture makes it difficult to adapt to topology changes; 2) the u...
Ruixiong Tian, Yongqiang Xiong, Qian Zhang, Bo Li,...
WAW
2007
Springer
162views Algorithms» more  WAW 2007»
15 years 6 months ago
Random Dot Product Graph Models for Social Networks
Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraet...
Stephen J. Young, Edward R. Scheinerman
PRL
2002
67views more  PRL 2002»
14 years 11 months ago
A pseudo-nearest-neighbor approach for missing data recovery on Gaussian random data sets
Missing data handling is an important preparation step for most data discrimination or mining tasks. Inappropriate treatment of missing data may cause large errors or false result...
Xiaolu Huang, Qiuming Zhu