1012 search results - page 43 / 203 » Segment intersection searching problems in general settings |
126
click to vote
DAWAK
2004
Springer
15 years 5 months ago
2004
Springer
Visualization techniques provide an outstanding role in KDD process for data analysis and mining. However, one image does not always convey successfully the inherent information fr...
101
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
129
click to vote
FOGA
2011
14 years 3 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
KDD
1995
ACM
15 years 3 months ago
1995
ACM
We discuss the use of database met hods for data mining. Recently impressive results have been achieved for some data mining problems using highly specialized and clever data stru...
107
click to vote
CIKM
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...