Sciweavers

391 search results - page 59 / 79
» Fast Similarity Search in Three-Dimensional Structure Databa...
Sort
View
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
14 years 9 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
BMCBI
2005
132views more  BMCBI 2005»
13 years 8 months ago
Kalign - an accurate and fast multiple sequence alignment algorithm
Background: The alignment of multiple protein sequences is a fundamental step in the analysis of biological data. It has traditionally been applied to analyzing protein families f...
Timo Lassmann, Erik L. L. Sonnhammer
IJCAI
2003
13 years 9 months ago
Concept Linking for Information Integration in Open Book and Sentinel
Opening up large amounts of loosely structured information for easy access and use is a complex problem. This paper describes two systems that address different aspects of the pro...
Stuart Watt
PR
2008
178views more  PR 2008»
13 years 6 months ago
An effective and fast iris recognition system based on a combined multiscale feature extraction technique
The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and the various sources of intra-class varia...
Makram Nabti, Ahmed Bouridane
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 8 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley