Sciweavers

5227 search results - page 928 / 1046
» Enterprise modeling using class and instance models
Sort
View
JMLR
2006
156views more  JMLR 2006»
13 years 7 months ago
Large Scale Multiple Kernel Learning
While classical kernel-based learning algorithms are based on a single kernel, in practice it is often desirable to use multiple kernels. Lanckriet et al. (2004) considered conic ...
Sören Sonnenburg, Gunnar Rätsch, Christi...
LMCS
2006
98views more  LMCS 2006»
13 years 7 months ago
Approximate reasoning for real-time probabilistic processes
We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisi...
Vineet Gupta, Radha Jagadeesan, Prakash Panangaden
ML
2006
ACM
113views Machine Learning» more  ML 2006»
13 years 7 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
BIOINFORMATICS
2005
140views more  BIOINFORMATICS 2005»
13 years 7 months ago
Profile-based direct kernels for remote homology detection and fold recognition
Motivation: Remote homology detection between protein sequences is a central problem in computational biology. Supervised learning algorithms based on support vector machines are ...
Huzefa Rangwala, George Karypis
TIT
2008
102views more  TIT 2008»
13 years 7 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo