Sciweavers

811 search results - page 9 / 163
» Avoiding Approximate Squares
Sort
View
JCO
2006
128views more  JCO 2006»
15 years 1 months ago
A combinatorial theorem on labeling squares with points and its application
In this paper, we present a combinatorial theorem on labeling disjoint axis-parallel squares of edge length two using points. Given an arbitrary set of disjoint axis-parallel squar...
Binhai Zhu, Minghui Jiang
115
Voted
JCT
2010
117views more  JCT 2010»
15 years 8 days ago
(2+2)-free posets, ascent sequences and pattern avoiding permutations
Abstract. We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2 + 2)-free posets and a certain class of involutions (or chord ...
Mireille Bousquet-Mélou, Anders Claesson, M...
ECCV
2004
Springer
16 years 3 months ago
The Least-Squares Error for Structure from Infinitesimal Motion
We analyze the least?squares error for structure from motion with a single infinitesimal motion ("structure from optical flow"). We present asymptotic approximations to ...
John Oliensis
SOFSEM
2004
Springer
15 years 7 months ago
Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
IJFCS
2006
70views more  IJFCS 2006»
15 years 1 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...