1403 search results - page 108 / 281 » About Approximations of Exponentials |
149
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
Given a classification problem, our goal is to find a low-dimensional linear transformation of the feature vectors which retains information needed to predict the class labels. We...
150
click to vote
ICML
1999
IEEE
16 years 5 months ago
1999
IEEE
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
139
click to vote
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
128
click to vote
CADE
2008
Springer
16 years 4 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
129
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We consider the problem of detecting a vector of symbols that is being transmitted over a fading multiple?input multiple?output (MIMO) channel, where each symbol is an ?th root of...