2100 search results - page 326 / 420 » Learning to rank on graphs |
161
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
174
click to vote
DEXA
2010
Springer
15 years 6 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
214
click to vote
BMCBI
2006
15 years 6 months ago
2006
Integration of heterogeneous data types is a challenging problem, especially in biology, where the number of databases and data types increase rapidly. Amongst the problems that o...
193
click to vote
PAMI
2007
15 years 6 months ago
2007
—This paper presents a novel approach for estimating the parameters for MRF-based stereo algorithms. This approach is based on a new formulation of stereo as a maximum a posterio...
165
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
In recent years, a number of projects have turned to Wikipedia to establish large-scale taxonomies that describe orders of magnitude more entities than traditional manually built ...