197 search results - page 10 / 40 » Simple deterministic approximation algorithms for counting m... |
WADS
2005
Springer
14 years 1 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
SODA
1998
ACM
13 years 9 months ago
1998
ACM
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
CPM
1998
Springer
13 years 12 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
NN
1998
Springer
13 years 7 months ago
1998
Springer
For complex database prediction problems such as medical diagnosis, the ARTMAP-IC neural network adds distributed prediction and category instance counting to the basic fuzzy ARTM...
CRV
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper proposes a novel method for estimating depth from a long image sequence captured by a moving camera. Our idea for estimating a depth map is very simple; only counting i...