2539 search results - page 325 / 508 » Updates for Structure Indexes |
146
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...
223
click to vote
AINA
2009
IEEE
16 years 1 months ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
174
click to vote
ICMCS
2006
IEEE
16 years 16 days ago
2006
IEEE
In this paper, an investigation of H.264/MPEG4-AVC conforming coding with hierarchical B pictures is presented. We analyze the coding delay and memory requirements, describe detai...
167
click to vote
SI3D
2005
ACM
16 years 2 days ago
2005
ACM
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...
148
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...