Sciweavers

6495 search results - page 245 / 1299
» Modeling Multidimensional Databases
Sort
View
KDD
1998
ACM
123views Data Mining» more  KDD 1998»
15 years 10 months ago
Scaling Clustering Algorithms to Large Databases
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
Paul S. Bradley, Usama M. Fayyad, Cory Reina
ICDE
1994
IEEE
127views Database» more  ICDE 1994»
15 years 10 months ago
Approximate Analysis of Real-Time Database Systems
During the past few years, several studies have been made on the performance of real-time database systems with respect to the number of transactions that miss their deadlines. Th...
Jayant R. Haritsa
IPPS
2007
IEEE
16 years 24 days ago
High Performance Database Searching with HMMer on FPGAs
1 Profile Hidden Markov Models (profile HMMs) are used as a popular bioinformatics tool for sensitive database searching, e.g. a set of not annotated protein sequences is compared...
Timothy F. Oliver, Leow Yuan Yeow, Bertil Schmidt
ISMIR
2003
Springer
107views Music» more  ISMIR 2003»
15 years 11 months ago
Effectiveness of HMM-based retrieval on large databases
We have investigated the performance of a hidden Markov model QBH retrieval system on a large musical database. The database is synthetic, generated from statistics gleaned from o...
Jonah Shifrin, William P. Birmingham
ICDM
2005
IEEE
177views Data Mining» more  ICDM 2005»
16 years 3 days ago
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
Loïck Lhote, François Rioult, Arnaud S...