Sciweavers

1763 search results - page 213 / 353
» Dependent random choice
Sort
View
DM
2011
264views Education» more  DM 2011»
13 years 3 months ago
Connectivity threshold and recovery time in rank-based models for complex networks
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Pawel Pralat
MA
2011
Springer
241views Communications» more  MA 2011»
13 years 3 months ago
On the distribution of the ratio of the largest eigenvalue to the trace of a Wishart matrix
The ratio of the largest eigenvalue divided by the trace of a p×p random Wishart matrix with n degrees of freedom and identity covariance matrix plays an important role in variou...
Boaz Nadler
JMLR
2010
165views more  JMLR 2010»
13 years 2 months ago
Learning with Blocks: Composite Likelihood and Contrastive Divergence
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...
INFOCOM
2011
IEEE
12 years 11 months ago
Transport throughput of secondary networks in spectrum sharing systems
—Spectrum sharing systems such as cognitive radio networks have drawn much attention recently due to their potential to resolve the conflict between increasing demand for spectr...
Chengzhi Li, Huaiyu Dai
JMLR
2012
11 years 10 months ago
Low rank continuous-space graphical models
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
Carl Smith, Frank Wood, Liam Paninski