4843 search results - page 442 / 969 » The Shortcut Problem - Complexity and Approximation |
137
Voted
JMLR
2006
15 years 5 months ago
2006
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
145
Voted
ML
2008
ACM
15 years 5 months ago
2008
ACM
Abstract. We consider a large volume principle for transductive learning that prioritizes the transductive equivalence classes according to the volume they occupy in hypothesis spa...
122
click to vote
APPML
2005
15 years 4 months ago
2005
Three iterative refinement schemes are studied for approximating the solutions of linear weakly singular Fredholm integral equations of the second kind. The rates of convergence a...
111
Voted
TSMC
2008
15 years 4 months ago
2008
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
145
click to vote
CJ
1998
15 years 4 months ago
1998
Approximation structuring clustering is an extension of what is usually called square-error clustering" onto various cluster structures and data formats. It appears to be not...