1427 search results - page 93 / 286 » Kernels for Semi-Structured Data |
134
click to vote
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
We present a manifold learning approach to dimensionality
reduction that explicitly models the manifold as a mapping
from low to high dimensional space. The manifold is
represen...
151
Voted
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
111
click to vote
PKDD
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
121
Voted
HICSS
2010
IEEE
15 years 8 months ago
2010
IEEE
Recent advances in virtualization technologies have sparked a renewed interest in the use of kernel and process virtualization as a security mechanism to enforce resource isolatio...
109
Voted
USENIX
2003
15 years 4 months ago
2003
This paper proposes two mechanisms for reducing the communication-related overheads of Web applications. One mechanism is user-level connection tracking, which allows an applicati...