Sciweavers

81 search results - page 11 / 17
» Estimating and Sampling Graphs with Multidimensional Random ...
Sort
View
ICIP
2005
IEEE
14 years 11 months ago
Sampling in practice: is the best reconstruction space bandlimited?
Shannon's sampling theory and its variants provide effective solutions to the problem of reconstructing a signal from its samples in some "shift-invariant " space, ...
Sathish Ramani, Dimitri Van De Ville, Michael Unse...
TOMACS
2002
113views more  TOMACS 2002»
13 years 9 months ago
Simulating heavy tailed processes using delayed hazard rate twisting
Consider the problem of estimating the small probability that the maximum of a random walk exceeds a large threshold, when the process has a negative drift and the underlying rand...
Sandeep Juneja, Perwez Shahabuddin
SOCIALCOM
2010
13 years 7 months ago
Estimating the Size of Online Social Networks
The huge size of online social networks (OSNs) makes it prohibitively expensive to precisely measure any properties which require the knowledge of the entire graph. To estimate the...
Shaozhi Ye, Shyhtsun Felix Wu
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 10 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
FOCS
2008
IEEE
14 years 4 months ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly