2168 search results - page 54 / 434 » Randomized Algorithms and Complexity Theory |
150
Voted
ICASSP
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...
122
Voted
ACL
1994
15 years 4 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
126
Voted
WIA
2009
Springer
15 years 9 months ago
2009
Springer
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...
111
Voted
COMPLEX
2009
Springer
15 years 9 months ago
2009
Springer
—In this paper we study the network structure in music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes an...
125
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
We have recently proposed an EM-style algorithm to optimize log-linear models with hidden variables. In this paper, we use this algorithm to optimize a hidden conditional random ...