1186 search results - page 8 / 238 » Improving Random Walk Performance |
102
click to vote
ECCV
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We propose a novel restoration method for defects and missing regions in video sequences, particularly in application to archive film restoration. Our statistical framew...
101
click to vote
COLING
2010
14 years 9 months ago
2010
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
110
click to vote
AIPS
2004
15 years 4 months ago
2004
We describe and evaluate a system for learning domainspecific control knowledge. In particular, given a planning domain, the goal is to output a control policy that performs well ...
CORR
2010
Springer
15 years 2 months ago
2010
Springer
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...
113
click to vote
ISPDC
2008
IEEE
15 years 9 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...