Sciweavers

141 search results - page 3 / 29
» Two Dimensional Parameterized Matching
Sort
View
SIAMCOMP
1998
113views more  SIAMCOMP 1998»
13 years 5 months ago
Two-Dimensional Periodicity in Rectangular Arrays
Abstract. String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has had a rather sparse set of techniques. This paper presents a new a...
Amihood Amir, Gary Benson
CCCG
2007
13 years 6 months ago
Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...
Peyman Afshani, Arash Farzan
TSMC
2010
13 years 2 hour ago
Toward Unconstrained Ear Recognition From Two-Dimensional Images
Abstract--Ear recognition, as a biometric, has several advantages. In particular, ears can be measured remotely and are also relatively static in size and structure for each indivi...
John D. Bustard, Mark S. Nixon
DLT
2007
13 years 6 months ago
From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. We introduce the notion of deterministic tiling system that generalizes determin...
Marcella Anselmo, Dora Giammarresi, Maria Madonia
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
13 years 11 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar