Sciweavers

741 search results - page 31 / 149
» Memory Dependence Prediction Using Store Sets
Sort
View
IJCNN
2008
IEEE
15 years 8 months ago
Two-level clustering approach to training data instance selection: A case study for the steel industry
— Nowadays, huge amounts of information from different industrial processes are stored into databases and companies can improve their production efficiency by mining some new kn...
Heli Koskimäki, Ilmari Juutilainen, Perttu La...
ESANN
1998
15 years 3 months ago
Recurrent SOM with local linear models in time series prediction
Recurrent Self-Organizing Map (RSOM) is studied in three di erent time series prediction cases. RSOM is used to cluster the series into local data sets, for which corresponding lo...
Timo Koskela, Markus Varsta, Jukka Heikkonen, Kimm...
DEXA
2004
Springer
126views Database» more  DEXA 2004»
15 years 7 months ago
Detecting Content Changes on Ordered XML Documents Using Relational Databases
Abstract. Previous works in change detection on XML focused on detecting changes to text file using ordered and unordered tree model. These approaches are not suitable for detecti...
Erwin Leonardi, Sourav S. Bhowmick, T. S. Dharma, ...
DAC
2006
ACM
15 years 7 months ago
High-performance operating system controlled memory compression
This article describes a new software-based on-line memory compression algorithm for embedded systems and presents a method of adaptively managing the uncompressed and compressed ...
Lei Yang, Haris Lekatsas, Robert P. Dick
CVPR
2010
IEEE
14 years 12 months ago
Compression of surface registrations using Beltrami coefficients
Surface registration is widely used in machine vision and medical imaging, where 1-1 correspondences between surfaces are computed to study their variations. Surface maps are usua...
Lok Ming Lui, Tsz Wai Wong, Paul M. Thompson, Tony...