824 search results - page 102 / 165 » Efficient Distance Computation Between Non-Convex Objects |
VLDB
2006
ACM
14 years 8 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In the field of detection and monitoring of dynamic objects in quasi-static scenes, background subtraction techniques where background is modeled at pixel-level, although showing ...
CISS
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— In previous work, we established a linear programming framework to determine sensor location from measured link distances between neighboring nodes in a network. Beside...
EVOW
2007
Springer
14 years 2 months ago
2007
Springer
Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated. Acceleration of a memetic algorithm requires focusing ...
IDA
2005
Springer
14 years 1 months ago
2005
Springer
—A simple yet effective unsupervised classification rule to discriminate between normal and abnormal data is based on accepting test objects whose nearest neighbors’ distances ...