2695 search results - page 353 / 539 » Learning Graph Matching |
146
click to vote
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
138
click to vote
WWW
2004
ACM
16 years 3 months ago
2004
ACM
Learning styles, as well as the best ways of responding with corresponding instructional strategies, have been intensively studied in the classical educational (classroom) setting...
191
click to vote
AII
1992
15 years 7 months ago
1992
Most theoretical models of inductive inference make the idealized assumption that the data available to a learner is from a single and accurate source. The subject of inaccuracies ...
116
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Typical content-based image retrieval (CBIR) solutions with regular Euclidean metric usually cannot achieve satisfactory performance due to the semantic gap challenge. Hence, rele...
114
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...