1525 search results - page 109 / 305 » Matching with Regular Constraints |
135
Voted
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
The recovery of writing trajectory from offline handwritten image is generally regarded as a difficult problem [1]. This paper introduced a method to recover the writing trajector...
143
Voted
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
This paper proposes a new approach to 3D reconstruction of piecewise planar objects based on two image regularities, connectivity and perspective symmetry. First, we formulate the...
164
Voted
ISBI
2004
IEEE
16 years 4 months ago
2004
IEEE
We present a new fast implementation of a non-rigid registration algorithm, based on a finite element elastic deformation model using the mutual information metric with a linear e...
134
click to vote
WCRE
2003
IEEE
15 years 9 months ago
2003
IEEE
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
152
Voted
CONEXT
2007
ACM
15 years 8 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...