Sciweavers

921 search results - page 80 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
BMCBI
2010
97views more  BMCBI 2010»
15 years 4 months ago
Kinome-wide interaction modelling using alignment-based and alignment-independent approaches for kinase description and linear a
Background: Protein kinases play crucial roles in cell growth, differentiation, and apoptosis. Abnormal function of protein kinases can lead to many serious diseases, such as canc...
Maris Lapinsh, Jarl E. S. Wikberg
DAWAK
2001
Springer
15 years 8 months ago
Adaptable Similarity Search Using Vector Quantization
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining applications, particularly for domains such as multimedia, CAD, molecular ...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
JIIS
2002
141views more  JIIS 2002»
15 years 3 months ago
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
SCCC
2003
IEEE
15 years 9 months ago
Improved Deletions in Dynamic Spatial Approximation Trees
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
Gonzalo Navarro, Nora Reyes
BDA
2004
15 years 5 months ago
Indexing XML Objects with Ordered Schema Trees
: XML DBMSs require new indexing techniques to efficiently process structural search and full-text search as integrated in XQuery. Much research has been done for indexing XML docu...
Laurent Yeh, Georges Gardarin