16430 search results - page 2978 / 3286 » On Computable Tree Functions |
172
click to vote
PR
2007
15 years 6 months ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
180
click to vote
PR
2007
15 years 6 months ago
2007
In this paper, a mean shift-based clustering algorithm is proposed. The mean shift is a kernel-type weighted mean procedure. Herein, we first discuss three classes of Gaussian, C...
171
click to vote
QUESTA
2007
15 years 6 months ago
2007
We propose a new queueing model named the acquisition queue. It differs from conventional queueing models in that the server not only serves customers, but also performs acquisit...
180
click to vote
PRL
2008
15 years 6 months ago
2008
This article introduces a scheme for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring groups in the data. T...
165
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract— We propose a planning algorithm that allows usersupplied domain knowledge to be exploited in the synthesis of information feedback policies for systems modeled as parti...