133 search results - page 25 / 27 » Approximating the Minimum Weight Triangulation |
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
NIPS
2007
13 years 7 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
ICIP
1999
IEEE
13 years 10 months ago
1999
IEEE
This paper presents a model for watermarking and some attacks on watermarks. Given the watermarked signal, the so-called Wiener attack performs minimum mean-squared error (MMSE) es...
TMM
2002
13 years 6 months ago
2002
This paper presents a model for watermarking and some attacks on watermarks. Given the watermarked signal, the so-called Wiener attack performs minimum mean-squared error (MMSE) es...
CPM
2005
Springer
13 years 8 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...