Sciweavers

1272 search results - page 2 / 255
» Approximate Parameterized Matching
Sort
View
ECCC
2007
86views more  ECCC 2007»
13 years 6 months ago
On Parameterized Approximability
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
Yijia Chen, Martin Grohe, Magdalena Grüber
BC
1998
117views more  BC 1998»
13 years 5 months ago
Where did I take that snapshot? Scene-based homing by image matching
In homing tasks, the goal is often not marked by visible objects but must be inferred from the spatial relation to the visual cues in the surrounding scene. The exact computation o...
Matthias O. Franz, Bernhard Schölkopf, Hanspe...
CGF
2010
111views more  CGF 2010»
13 years 6 months ago
One Point Isometric Matching with the Heat Kernel
A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particul...
Maks Ovsjanikov, Quentin Mérigot, Facundo M...
CPM
2005
Springer
87views Combinatorics» more  CPM 2005»
13 years 11 months ago
Two Dimensional Parameterized Matching
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
Carmit Hazay, Moshe Lewenstein, Dekel Tsur
DATE
2007
IEEE
92views Hardware» more  DATE 2007»
14 years 10 days ago
Random sampling of moment graph: a stochastic Krylov-reduction algorithm
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
Zhenhai Zhu, Joel R. Phillips