Sciweavers

1541 search results - page 32 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
FOCS
2009
IEEE
15 years 10 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
SIGIR
2008
ACM
15 years 4 months ago
Multi-document summarization using cluster-based link analysis
The Markov Random Walk model has been recently exploited for multi-document summarization by making use of the link relationships between sentences in the document set, under the ...
Xiaojun Wan, Jianwu Yang
COCOON
2009
Springer
15 years 10 months ago
Sublinear-Time Algorithms for Tournament Graphs
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
Stefan S. Dantchev, Tom Friedetzky, Lars Nagel
TSP
2011
170views more  TSP 2011»
14 years 10 months ago
Model Selection for Sinusoids in Noise: Statistical Analysis and a New Penalty Term
—Detection of the number of sinusoids embedded in noise is a fundamental problem in statistical signal processing. Most parametric methods minimize the sum of a data fit (likeli...
Boaz Nadler, Leonid Kontorovich
ICASSP
2009
IEEE
15 years 10 months ago
ViBE: A powerful random technique to estimate the background in video sequences
Background subtraction is a crucial step in many automatic video content analysis applications. While numerous acceptable techniques have been proposed so far for background extra...
Olivier Barnich, Marc Van Droogenbroeck