Sciweavers

4278 search results - page 244 / 856
» Data prefetch mechanisms
Sort
View
BMCBI
2005
73views more  BMCBI 2005»
15 years 6 months ago
An analysis of extensible modelling for functional genomics data
Background: Several data formats have been developed for large scale biological experiments, using a variety of methodologies. Most data formats contain a mechanism for allowing e...
Andrew R. Jones, Norman W. Paton
KDD
2006
ACM
130views Data Mining» more  KDD 2006»
16 years 7 months ago
Mining relational data through correlation-based multiple view validation
Commercial relational databases currently store vast amounts of real-world data. The data within these relational repositories are represented by multiple relations, which are int...
Hongyu Guo, Herna L. Viktor
PR
2006
87views more  PR 2006»
15 years 6 months ago
Prototype reduction schemes applicable for non-stationary data sets
All of the prototype reduction schemes (PRS) which have been reported in the literature, process time-invariant data to yield a subset of prototypes that are useful in nearest-nei...
Sang-Woon Kim, B. John Oommen
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
15 years 6 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
16 years 3 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat