1272 search results - page 88 / 255 » Approximate Parameterized Matching |
107
click to vote
SODA
2001
ACM
15 years 21 days ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
121
click to vote
MIAR
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract. In this paper, we present a novel approach to matching cerebral vascular trees obtained from 3D-RA data-sets based on minimization of tree edit distance. Our approach is ...
DATE
2003
IEEE
15 years 4 months ago
2003
IEEE
While fast timing analysis methods, such as asymptotic waveform evaluation (AWE), have been well established for linear circuits, the timing analysis for non-linear circuits, whic...
119
click to vote
TCSV
2011
14 years 6 months ago
2011
This paper proposes an efficient and robust background compensation method for pan-tilt-zoom cameras. The proposed method approximates the relation between consecutive images to a...
131
click to vote
TIT
2010
14 years 6 months ago
2010
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...