5115 search results - page 131 / 1023 » On Randomized Lanczos Algorithms |
163
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
198
click to vote
MICCAI
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Updating segmentation results in real-time based on repeated user input is a reliable way to guarantee accuracy, paramount in medical imaging applications, while making e...
374
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
170
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We study the spectral norm of matrices M that can be factored as M = BA, where A is a random matrix with independent mean zero entries and B is a fixed matrix. Under the (4 + )-th ...
193
click to vote
ICDM
2007
IEEE
16 years 20 days ago
2007
IEEE
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...