Sciweavers

5153 search results - page 21 / 1031
» Introduction to Randomized Algorithms
Sort
View
ICC
2009
IEEE
155views Communications» more  ICC 2009»
15 years 4 months ago
Modeling Random Walk Search Algorithms in Unstructured P2P Networks with Social Information
—Random walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algori...
Jing Xie, King-Shan Lui
PIMRC
2008
IEEE
15 years 4 months ago
Bayesian inference in linear models with a random Gaussian matrix : Algorithms and complexity
—We consider the Bayesian inference of a random Gaussian vector in a linear model with a random Gaussian matrix. We review two approaches to finding the MAP estimator for this m...
Ido Nevat, Gareth W. Peters, Jinhong Yuan
ICCV
2007
IEEE
15 years 11 months ago
A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm
In this work, we present a common framework for seeded image segmentation algorithms that yields two of the leading methods as special cases - The Graph Cuts and the Random Walker...
Ali Kemal Sinop, Leo Grady
AAIM
2008
Springer
116views Algorithms» more  AAIM 2008»
15 years 4 months ago
An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...
Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang
SODA
2004
ACM
127views Algorithms» more  SODA 2004»
14 years 11 months ago
An optimal randomized algorithm for maximum Tukey depth
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
Timothy M. Chan