958 search results - page 102 / 192 » Efficient data structures for range-aggregate queries on tre... |
164
Voted
COMGEO
2008
ACM
15 years 3 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
268
Voted
ICDE
1996
IEEE
16 years 5 months ago
1996
IEEE
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
142
Voted
SSDBM
2010
IEEE
15 years 1 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
115
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: Proteins show a great variety of 3D conformations, which can be used to infer their evolutionary relationship and to classify them into more general groups; therefore ...
156
Voted
IWMMDBMS
1998
15 years 5 months ago
1998
: In recent years the fusion of multimedia information from multiple real-time sources and databases has become increasingly important because of its practical significance in many...