Sciweavers

1136 search results - page 142 / 228
» New developments in the InterPro database
Sort
View
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
15 years 2 months ago
High Performance Data Mining Using the Nearest Neighbor Join
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
Christian Böhm, Florian Krebs
PODS
1997
ACM
182views Database» more  PODS 1997»
15 years 2 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
GCB
2004
Springer
223views Biometrics» more  GCB 2004»
15 years 1 months ago
PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
Michael Beckstette, Dirk Strothmann, Robert Homann...
ER
2006
Springer
135views Database» more  ER 2006»
15 years 1 months ago
Towards Automatic Evaluation of Learning Object Metadata Quality
Thanks to recent developments on automatic generation of metadata and interoperability between repositories, the production, management and consumption of learning object metadata ...
Xavier Ochoa, Erik Duval
DEXA
2008
Springer
117views Database» more  DEXA 2008»
14 years 11 months ago
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
Gang Qian, Hyun-Jeong Seok, Qiang Zhu, Sakti Prama...