Sciweavers

183 search results - page 12 / 37
» The Degree Distribution of Random k-Trees
Sort
View
RSA
2008
94views more  RSA 2008»
14 years 11 months ago
Random mappings with exchangeable in-degrees
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
Jennie C. Hansen, Jerzy Jaworski
DM
2011
264views Education» more  DM 2011»
14 years 6 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
TIT
2010
97views Education» more  TIT 2010»
14 years 6 months ago
Why does the Kronecker model result in misleading capacity estimates?
Many recent works that study the performance of multi-input multi-output (MIMO) systems in practice assume a Kronecker model where the variances of the channel entries, upon decom...
Vasanthan Raghavan, Jayesh H. Kotecha, Akbar M. Sa...
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
16 years 1 months ago
On Randomization, Public Information and the Curse of Dimensionality
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
Charu C. Aggarwal
ICDCS
2007
IEEE
15 years 6 months ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta