Sciweavers

1541 search results - page 72 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
APPROX
2008
Springer
125views Algorithms» more  APPROX 2008»
15 years 5 months ago
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
102
Voted
ICASSP
2011
IEEE
14 years 6 months ago
On the success of network inference using a markov routing model
In this paper we discuss why a simple network topology inference algorithm based on network co-occurrence measurements and a Markov random walk model for routing enables perfect t...
Laura Balzano, Robert Nowak, Matthew Roughan
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
15 years 9 months ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan
COLT
1999
Springer
15 years 7 months ago
Uniform-Distribution Attribute Noise Learnability
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
Nader H. Bshouty, Jeffrey C. Jackson, Christino Ta...
SDM
2010
SIAM
195views Data Mining» more  SDM 2010»
15 years 4 months ago
MACH: Fast Randomized Tensor Decompositions
Tensors naturally model many real world processes which generate multi-aspect data. Such processes appear in many different research disciplines, e.g, chemometrics, computer visio...
Charalampos E. Tsourakakis