Sciweavers

7930 search results - page 305 / 1586
» Greedy in Approximation Algorithms
Sort
View
JMLR
2002
100views more  JMLR 2002»
15 years 6 months ago
On the Convergence of Optimistic Policy Iteration
We consider a finite-state Markov decision problem and establish the convergence of a special case of optimistic policy iteration that involves Monte Carlo estimation of Q-values,...
John N. Tsitsiklis
ACL
2009
15 years 4 months ago
Optimizing Word Alignment Combination For Phrase Table Training
Combining word alignments trained in two translation directions has mostly relied on heuristics that are not directly motivated by intended applications. We propose a novel method...
Yonggang Deng, Bowen Zhou
CLEF
2011
Springer
14 years 6 months ago
External Plagiarism Detection using Information Retrieval and Sequence Alignment - Notebook for PAN at CLEF 2011
Abstract This paper describes the University of Sheffield entry for the 3rd International Competition on Plagiarism Detection which attempted the monolingual external plagiarism d...
Rao Muhammad Adeel Nawab, Mark Stevenson, Paul D. ...
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 7 months ago
A constant-factor approximation for stochastic Steiner forest
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
Anupam Gupta, Amit Kumar
CVPR
2010
IEEE
15 years 11 months ago
"Lattice Cut" - Constructing superpixels using layer constraints
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for featur...
Alastair Moore, Simon Prince