Sciweavers

1265 search results - page 186 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
CIKM
2008
Springer
13 years 11 months ago
Modeling hidden topics on document manifold
Topic modeling has been a key problem for document analysis. One of the canonical approaches for topic modeling is Probabilistic Latent Semantic Indexing, which maximizes the join...
Deng Cai, Qiaozhu Mei, Jiawei Han, Chengxiang Zhai
IMC
2006
ACM
14 years 2 months ago
On unbiased sampling for unstructured peer-to-peer networks
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
ASUNAM
2010
IEEE
13 years 10 months ago
COSI: Cloud Oriented Subgraph Identification in Massive Social Networks
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
HIS
2009
13 years 6 months ago
On Some Properties of the lbest Topology in Particle Swarm Optimization
: Particle Swarm Optimization (PSO) is arguably one of the most popular nature- inspired algorithms for real parameter optimization at present. The existing theoretical research on...
Sayan Ghosh, Debarati Kundu, Kaushik Suresh, Swaga...
MOBIHOC
2009
ACM
14 years 9 months ago
Predict and relay: an efficient routing in disruption-tolerant networks
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
Quan Yuan, Ionut Cardei, Jie Wu