1326 search results - page 168 / 266 » Approximate Tree Kernels |
155
Voted
MMM
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
126
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
104
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
We have developed a new Linear Support Vector Machine (SVM) training algorithm called OCAS. Its computational effort scales linearly with the sample size. In an extensive empirica...
137
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
Most existing sparse Gaussian process (g.p.) models seek computational advantages by basing their computations on a set of m basis functions that are the covariance function of th...
215
click to vote
POPL
2007
ACM
16 years 2 months ago
2007
ACM
Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent da...