33 search results - page 4 / 7 » Petascale Computing for Large-Scale Graph Problems |
RECOMB
2007
Springer
15 years 9 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
ECCV
2010
Springer
15 years 1 months ago
2010
Springer
We address the problem of large scale image retrieval in a wide-baseline setting, where for any query image all the matching database images will come from very different viewpoint...
DAGM
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...
191
click to vote
SDM
2011
SIAM
14 years 10 days ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging. Existing high-level parallel abstractions like MapReduce are insuf...