9209 search results - page 387 / 1842 » Data Space Randomization |
221
click to vote
TEC
2002
15 years 6 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
303
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
148
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
The nearest neighbor (NN) rule is a simple and intuitive method for solving classification problems. Originally, it uses distances to the complete training set. It performs well, ...
177
click to vote
ICML
1996
IEEE
16 years 7 months ago
1996
IEEE
Finding structure in multiple streams of data is an important problem. Consider the streams of data owing from a robot's sensors, the monitors in an intensive care unit, or p...
184
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
Most cost function based clustering or partitioning methods measure the compactness of groups of data. In contrast to this picture of a point source in feature space, some data sou...