4541 search results - page 106 / 909 » Cache-Oblivious Algorithms and Data Structures |
110
click to vote
BMCBI
2011
14 years 2 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
100
click to vote
ESA
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
FLAIRS
2001
15 years 18 days ago
2001
Inrecenttimes,severalextensionsofdataminingmethods andtechniqueshavebeenexploredaimingatdealingwith advanceddatabases.Manypromisingapplicationsof inductivelogicprogramming(ILP)tok...
114
click to vote
KDD
2012
ACM
13 years 1 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
EUROPAR
2003
Springer
15 years 4 months ago
2003
Springer
This paper presents the design and experimental evaluation of two dynamic load partitioning and balancing strategies for parallel Structured Adaptive Mesh Refinement (SAMR) applic...