11211 search results - page 359 / 2243 » Rank-Sensitive Data Structures |
219
click to vote
EDBT
1998
ACM
15 years 11 months ago
1998
ACM
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
266
click to vote
MICCAI
2000
Springer
15 years 10 months ago
2000
Springer
We present a novel approach to statistical shape analysis of anatomical structures based on small sample size learning techniques. The high complexity of shape models used in medic...
145
click to vote
ICMCS
2000
IEEE
15 years 11 months ago
2000
IEEE
Most of the existing work on modeling variable bit rate (VBR) video sources does not either explicitly take into account groupof-pictures (GOP) or assumes a fixed GOP structure. R...
151
click to vote
APPML
2002
15 years 6 months ago
2002
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
151
click to vote
TACAS
2007
Springer
16 years 23 days ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...