5619 search results - page 331 / 1124 » A Region Inference Algorithm |
235
click to vote
CPM
1998
Springer
15 years 11 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...
182
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we propose to use a distance metric based on user-preferences to efficiently find solutions for manyobjective problems. We use a particle swarm optimization (PSO) a...
225
click to vote
ICPP
2000
IEEE
15 years 11 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
247
click to vote
GIS
2004
ACM
16 years 7 months ago
2004
ACM
This paper discusses a variety of ways to place diagrams like pie charts on maps, in particular, administrative subdivisions. The different ways come from different models of the ...
209
click to vote
W2GIS
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...