1105 search results - page 101 / 221 » Approximate Spectral Clustering. |
96
Voted
ICPR
2000
IEEE
16 years 1 months ago
2000
IEEE
In this paper we focus on an interpretation of Gaussian radial basis functions (GRBF) which motivates extensions and learning strategies. Specifically, we show that GRBF regressio...
94
Voted
ICDAR
2007
IEEE
15 years 7 months ago
2007
IEEE
We model on-line ink traces for a set of 219 symbols to “best fit” low-degree polynomial series. Using a collection of mathematical writing samples, we find that in many cas...
LATIN
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
109
click to vote
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...
111
click to vote
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper introduces a new approach to actionvalue function approximation by learning basis functions from a spectral decomposition of the state-action manifold. This paper exten...