Sciweavers

5138 search results - page 37 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
DAM
2006
79views more  DAM 2006»
15 years 6 months ago
A simple expected running time analysis for randomized "divide and conquer" algorithms
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
Brian C. Dean
ICC
2009
IEEE
155views Communications» more  ICC 2009»
16 years 20 days 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
JCPHY
2011
109views more  JCPHY 2011»
14 years 8 months ago
Fast construction of hierarchical matrix representation from matrix-vector multiplication
We develop a hierarchical matrix construction algorithm using matrixvector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorith...
Lin Lin, Jianfeng Lu, Lexing Ying
PIMRC
2008
IEEE
16 years 9 days 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
16 years 8 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