416 search results - page 17 / 84 » Simple and Efficient Algorithm for Approximate Dictionary Ma... |
DAWAK
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...