4541 search results - page 507 / 909 » Cache-Oblivious Algorithms and Data Structures |
168
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
190
click to vote
ACAL
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. This paper illustrates how the Quadratic Assignment Problem (QAP) is used as a mathematical model that helps to produce a visualization of microarray data, based on the r...
180
click to vote
NBIS
2007
Springer
16 years 19 days ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
188
click to vote
IS
2007
15 years 6 months ago
2007
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
177
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...