Sciweavers

18451 search results - page 3561 / 3691
» Selecting the
Sort
View
JMLR
2008
169views more  JMLR 2008»
13 years 9 months ago
Multi-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
Jieping Ye, Shuiwang Ji, Jianhui Chen
JMLR
2008
73views more  JMLR 2008»
13 years 9 months ago
On the Suitable Domain for SVM Training in Image Coding
Conventional SVM-based image coding methods are founded on independently restricting the distortion in every image coefficient at some particular image representation. Geometrical...
Gustavo Camps-Valls, Juan Gutierrez, Gabriel G&oac...
JMLR
2008
159views more  JMLR 2008»
13 years 9 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
CSDA
2007
264views more  CSDA 2007»
13 years 9 months ago
Model-based methods to identify multiple cluster structures in a data set
Model-based clustering exploits finite mixture models for detecting group in a data set. It provides a sound statistical framework which can address some important issues, such as...
Giuliano Galimberti, Gabriele Soffritti
JACM
2006
99views more  JACM 2006»
13 years 9 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
« Prev « First page 3561 / 3691 Last » Next »