Sciweavers

1449 search results - page 245 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
132
Voted
ICML
1999
IEEE
16 years 3 months ago
Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes
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...
Sebastian Thrun, John Langford, Dieter Fox
138
Voted
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 3 months ago
On updates that constrain the features' connections during learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Jian Huang 0002
138
Voted
RECOMB
2006
Springer
16 years 2 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
127
Voted
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
16 years 2 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
112
Voted
SODA
2010
ACM
135views Algorithms» more  SODA 2010»
16 years 1 days ago
Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications
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...
Anthony Man-Cho So