Sciweavers

1227 search results - page 36 / 246
» Approximate Kernel Clustering
Sort
View
NIPS
2007
14 years 11 months ago
Bayesian binning beats approximate alternatives: estimating peri-stimulus time histograms
The peristimulus time histogram (PSTH) and its more continuous cousin, the spike density function (SDF) are staples in the analytic toolkit of neurophysiologists. The former is us...
Dominik Endres, Mike W. Oram, Johannes E. Schindel...
CVPR
2009
IEEE
15 years 1 months ago
Classification of tensors and fiber tracts using Mercer-kernels encoding soft probabilistic spatial and diffusion information
In this paper, we present a kernel-based approach to the clustering of diffusion tensors and fiber tracts. We propose to use a Mercer kernel over the tensor space where both spati...
Radhouène Neji, Nikos Paragios, Gilles Fleu...
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
14 years 11 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
ICASSP
2011
IEEE
14 years 1 months ago
Polytope kernel density estimates on Delaunay graphs
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
Erhan Bas, Deniz Erdogmus
CVPR
2011
IEEE
14 years 5 months ago
Local Isomorphism to Solve the Pre-image Problem in Kernel Methods
Kernel methods have been popular over the last decade to solve many computer vision, statistics and machine learning problems. An important, both theoretically and practically, op...
Dong Huang, Yuandong Tian, Fernando DelaTorre