Sciweavers

712 search results - page 43 / 143
» A mixture model for random graphs
Sort
View
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
14 years 4 months ago
Improving partial cover of Random Walks in large-scale Wireless Sensor Networks
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
Leonidas Tzevelekas, Ioannis Stavrakakis
HT
2010
ACM
14 years 7 days ago
Analysis of graphs for digital preservation suitability
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
Charles L. Cartledge, Michael L. Nelson
JMLR
2008
83views more  JMLR 2008»
13 years 10 months ago
Generalization from Observed to Unobserved Features by Clustering
We argue that when objects are characterized by many attributes, clustering them on the basis of a random subset of these attributes can capture information on the unobserved attr...
Eyal Krupka, Naftali Tishby
ICASSP
2010
IEEE
13 years 10 months ago
Towards multi-speaker unsupervised speech pattern discovery
In this paper, we explore the use of a Gaussian posteriorgram based representation for unsupervised discovery of speech patterns. Compared with our previous work, the new approach...
Yaodong Zhang, James R. Glass
SIGMETRICS
2004
ACM
107views Hardware» more  SIGMETRICS 2004»
14 years 3 months ago
On zone-balancing of peer-to-peer networks: analysis of random node join
Balancing peer-to-peer graphs, including zone-size distributions, has recently become an important topic of peer-topeer (P2P) research [1], [2], [6], [19], [31], [36]. To bring an...
Xiaoming Wang, Yueping Zhang, Xiafeng Li, Dmitri L...