597 search results - page 18 / 120 » Homomorphisms of random paths |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...
TR
2008
14 years 9 months ago
2008
Abstract--As an alternative to traditional life testing, degradation tests can be effective in assessing product reliability when measurements of degradation leading to failure can...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
ECCV
2010
Springer
14 years 8 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...
100
click to vote
ALGORITHMICA
2008
14 years 9 months ago
2008
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...