736 search results - page 16 / 148 » A dynamic data structure for approximate range searching |
ICCSA
2003
Springer
14 years 2 months ago
2003
Springer
In this paper, we describe a technique for representing and displaying high dynamic range image (HDRI) as a texture map in VRML structure. To do this, we designed and implemented e...
VLDB
2004
ACM
14 years 2 months ago
2004
ACM
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
TC
2008
13 years 8 months ago
2008
One of the most critical resource management issues in the use of ternary content addressable memory (TCAM) for packet classification/filtering is how to effectively support filte...
Publication
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
ADL
2000
Springer
14 years 1 months ago
2000
Springer
Digital libraries are a core information technology. When the stored data is complex, e.g. high-resolution images or molecular protein structures, simple query types like the exac...