337 search results - page 3 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Random projection methods give distributions over k
APPROX
2006
Springer
13 years 10 months ago
2006
Springer
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Many recent techniques for low-level vision problems such as image denoising are formulated in terms of Markov random field (MRF) or conditional random field (CRF) models. Nonethel...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...