1542 search results - page 131 / 309 » Kernelization of packing problems |
104
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
We consider the problem of embedding arbitrary objects (e.g., images, audio, documents) into Euclidean space subject to a partial order over pairwise distances. Partial order cons...
118
click to vote
ICML
2001
IEEE
16 years 2 months ago
2001
IEEE
Data noise is present in many machine learning problems domains, some of these are well studied but others have received less attention. In this paper we propose an algorithm for ...
139
click to vote
ISAAC
2009
Springer
15 years 8 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
ICDAR
2007
IEEE
15 years 8 months ago
2007
IEEE
The effectiveness of kernel fisher discrimination analysis (KFDA) has been demonstrated by many pattern recognition applications. However, due to the large size of Gram matrix to ...