Sciweavers

1722 search results - page 84 / 345
» On the sample mean of graphs
Sort
View
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
15 years 23 days ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
106
Voted
CCE
2010
14 years 10 months ago
Multi-scale methods and complex processes: A survey and look ahead
AbstrAct A comprehensive overview of numerical methodologies currently available for analyzing and building understanding of complex processes is presented. Both equation-free and ...
Angelo Lucia
94
Voted
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
15 years 2 months ago
Fast Multilevel Transduction on Graphs
The recent years have witnessed a surge of interest in graphbased semi-supervised learning methods. The common denominator of these methods is that the data are represented by the...
Fei Wang, Changshui Zhang
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
16 years 28 days ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige
PIMRC
2010
IEEE
14 years 10 months ago
Frame delay distribution analysis of IEEE 802.11 networks using Signal Flow Graphs
Frame delay variance in CSMA/CA networks is large. Wireless applications may require both, limited mean delay and limited delay jitter. These parameters can be derived easily from ...
Ralf Jennen, Sebastian Max, Bernhard Walke