Sciweavers

JDA
2007
77views more  JDA 2007»
13 years 4 months ago
Path coupling without contraction
Path coupling is a useful technique for simplifying the analysis of a coupling of a Markov chain. Rather than defining and analysing the coupling on every pair in Ω×Ω, where...
Magnus Bordewich, Martin E. Dyer
JDA
2007
60views more  JDA 2007»
13 years 4 months ago
On shredders and vertex connectivity augmentation
Gilad Liberman, Zeev Nutov
JDA
2007
73views more  JDA 2007»
13 years 4 months ago
Parameterized matching with mismatches
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
Alberto Apostolico, Péter L. Erdös, Mo...
JDA
2007
45views more  JDA 2007»
13 years 4 months ago
Local similarity between quotiented ordered trees
Aïda Ouangraoua, Pascal Ferraro, Laurent Tich...
JDA
2007
60views more  JDA 2007»
13 years 4 months ago
Cut problems in graphs with a budget constraint
Roee Engelberg, Jochen Könemann, Stefano Leon...