Sciweavers

7129 search results - page 569 / 1426
» Approximation Algorithms for Treewidth
Sort
View
ACL
2004
15 years 9 months ago
Computing Locally Coherent Discourses
We present the first algorithm that computes optimal orderings of sentences into a locally coherent discourse. The algorithm runs very efficiently on a variety of coherence measur...
Ernst Althaus, Nikiforos Karamanis, Alexander Koll...
ACL
2006
15 years 9 months ago
Speeding Up Full Syntactic Parsing by Leveraging Partial Parsing Decisions
Parsing is a computationally intensive task due to the combinatorial explosion seen in chart parsing algorithms that explore possible parse trees. In this paper, we propose a meth...
Elliot Glaysher, Dan I. Moldovan
238
Voted
JMLR
2010
198views more  JMLR 2010»
15 years 6 months ago
On Learning with Integral Operators
A large number of learning algorithms, for example, spectral clustering, kernel Principal Components Analysis and many manifold methods are based on estimating eigenvalues and eig...
Lorenzo Rosasco, Mikhail Belkin, Ernesto De Vito
ICIP
2003
IEEE
16 years 9 months ago
A variational method for Bayesian blind image deconvolution
In this paper the blind image deconvolution (BID) problem is solved using the Bayesian framework. In order to find the parameters of the proposed Bayesian model we present a new g...
Aristidis Likas, Nikolas P. Galatsanos
ICML
2007
IEEE
16 years 8 months ago
Automatic shaping and decomposition of reward functions
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
Bhaskara Marthi