Sciweavers

958 search results - page 102 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
COMGEO
2008
ACM
14 years 10 months ago
Lower bounds for expected-case planar point location
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...
Theocharis Malamatos
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
15 years 11 months ago
Similarity Indexing with the SS-tree
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...
David A. White, Ramesh Jain
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
14 years 8 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
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...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
BMCBI
2010
113views more  BMCBI 2010»
14 years 10 months ago
Efficient protein alignment algorithm for protein search
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 ...
Zaixin Lu, Zhiyu Zhao, Bin Fu
IWMMDBMS
1998
139views more  IWMMDBMS 1998»
14 years 11 months ago
Fusion of Multimedia Information
: 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...
Shi-Kuo Chang, Taieb Znati