168 search results - page 31 / 34 » et 1998 |
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...
ERCIMDL
1998
Springer
13 years 12 months ago
1998
Springer
Multimedia communication is a part of everyday life and its appearance in computer applications is increasing in frequency and diversity. Intelligent or knowledge based computer su...
KDD
1998
ACM
13 years 12 months ago
1998
ACM
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
EPS
1997
Springer
13 years 12 months ago
1997
Springer
In spirit of the earlier works done by Arthur (1992) and Palmer et al. (1993), this paper models speculators with genetic programming (GP) in a production economy (Muthian Economy)...
APGV
2008
ACM
13 years 9 months ago
2008
ACM
Recovering 3D shape from shading is an ill-posed problem that the visual system can solve only by making use of additional information such as the position of the light source. Pr...