Sciweavers

2100 search results - page 80 / 420
» Learning to rank on graphs
Sort
View
APWEB
2010
Springer
15 years 6 months ago
A Space and Time Efficient Algorithm for SimRank Computation
SimRank has been proposed to rank web documents based on a graph model on hyperlinks. The existing techniques for conducting SimRank computation adopt an iteration computation para...
Weiren Yu, Xuemin Lin, Jiajin Le
ICML
2009
IEEE
16 years 7 months ago
Fitting a graph to vector data
Samuel I. Daitch, Jonathan A. Kelner, Daniel A. Sp...
EUROPAR
2004
Springer
15 years 11 months ago
A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
Edson Norberto Cáceres, Frank K. H. A. Dehn...
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
15 years 6 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi