Sciweavers

559 search results - page 81 / 112
» Indexing Weighted-Sequences in Large Databases
Sort
View
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
14 years 1 months ago
Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
Stefanos Ougiaroglou, Alexandros Nanopoulos, Apost...
IPPS
2008
IEEE
14 years 4 months ago
Supporting high performance bioinformatics flat-file data processing using indices
As an essential part of in vitro analysis, biological database query has become more and more important in the research process. A few challenges that are specific to bioinformat...
Xuan Zhang, Gagan Agrawal
MDM
2004
Springer
154views Communications» more  MDM 2004»
14 years 3 months ago
On Bulk Loading TPR-Tree
TPR-tree is a practical index structure for moving object databases. Due to the uniform distribution assumption, TPR-tree’s bulk loading algorithm (TPR) is relatively inefficie...
Bin Lin, Jianwen Su
IDEAS
1999
IEEE
144views Database» more  IDEAS 1999»
14 years 1 months ago
The Scalability of an Object Descriptor Architecture OODBMS
An object database management system (OODBMS) has been often criticized for its alleged insufficient scalability for a large-scale production system. We investigated the scalabili...
Kwok K. Yu, Byung Suk Lee, Michael R. Olson
CSMR
2008
IEEE
14 years 4 months ago
Goto Elimination Strategies in the Migration of Legacy Code to Java
Legacy systems are often large and difficult to maintain, but rewriting them from scratch is usually not a viable option. Reenginering remains the only way to modernize them. We ...
Mariano Ceccato, Paolo Tonella, Cristina Matteotti