241 search results - page 15 / 49 » Fast heuristics for large scale covering-location problems |
108
click to vote
IJCAI
1997
14 years 11 months ago
1997
In the dynamical systems approach to robot path planning both sensed and remembered information contribute to shape a nonlinear vector eld that governs the behavior of an autonomo...
77
Voted
DEXA
2004
Springer
15 years 3 months ago
2004
Springer
: In this paper, we will propose PC-Filter (PC stands for Partition Comparison), a robust data filter for approximately duplicate record detection in large databases. PC-Filter dis...
AUSAI
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
70
Voted
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
84
Voted
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
We study the task of detecting the occurrence of objects in large image collections or in videos, a problem that combines aspects of content based image retrieval and object locali...