Sciweavers

1272 search results - page 5 / 255
» Approximate Parameterized Matching
Sort
View
SODA
2010
ACM
177views Algorithms» more  SODA 2010»
16 years 2 months ago
Convergence, Stability, and Discrete Approximation of Laplace Spectra
Spectral methods have been widely used in a broad range of application fields. One important object involved in such methods is the Laplace-Beltrami operator of a manifold. Indeed...
Tamal K. Dey, Pawas Ranjan, Yusu Wang
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
15 years 11 months ago
Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
Dániel Marx, Igor Razgon
127
Voted
CPM
2006
Springer
106views Combinatorics» more  CPM 2006»
15 years 8 months ago
Sublinear Algorithms for Parameterized Matching
Leena Salmela, Jorma Tarhio
108
Voted
IPL
2008
72views more  IPL 2008»
15 years 5 months ago
On the parameterized complexity of d-dimensional point set pattern matching
Sergio Cabello, Panos Giannopoulos, Christian Knau...
173
Voted
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 6 months ago
Parameterizing pair approximations for takeover dynamics
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
Joshua L. Payne, Margaret J. Eppstein