325 search results - page 57 / 65 » Group Nearest Neighbor Queries |
ICPP
2006
IEEE
14 years 3 months ago
2006
IEEE
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
MM
2003
ACM
14 years 3 months ago
2003
ACM
This paper describes a novel methodology for implementing video search functions such as retrieval of near-duplicate videos and recognition of actions in surveillance video. Video...
COMPSAC
2007
IEEE
14 years 4 months ago
2007
IEEE
Service discovery is very useful in pervasive computing environments. A service discovery architecture based on anycast is proposed. A wellknown anycast address is defined first, ...
ISCI
2007
13 years 9 months ago
2007
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...