16666 search results - page 142 / 3334 » Descriptive and Computational Complexity |
145
Voted
RTA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
162
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
Modeling objects using formal grammars has recently regained much attention in computer vision. Probabilistic logic programming, such as Bilattice based Logical Reasoning (BLR), i...
120
Voted
SIBGRAPI
2007
IEEE
15 years 10 months ago
2007
IEEE
A good shape descriptor is necessary for automatically identifying landmarks on boundaries. Our method of boundary shape description is based on the notion of cscale, which is a n...
122
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Prominent feature point descriptors such as SIFT and
SURF allow reliable real-time matching but at a compu-
tational cost that limits the number of points that can be
handled on...
145
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
The problem of recognizing classes of objects as opposed to special instances requires methods of comparing images that capture the variation within the class while they discrimina...