1016 search results - page 120 / 204 » Generalized distances between rankings |
126
click to vote
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
Pairwise constraints specify whether or not two samples should be in one cluster. Although it has been successful to incorporate them into traditional clustering methods, such as ...
196
click to vote
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
152
click to vote
MM
2004
ACM
15 years 6 months ago
2004
ACM
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...
118
click to vote
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
ORL
1998
15 years 28 days ago
1998
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...