Sciweavers

7648 search results - page 416 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
UAI
2000
15 years 6 months ago
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
Andrew W. Moore
CASES
2003
ACM
15 years 10 months ago
Compiler-decided dynamic memory allocation for scratch-pad based embedded systems
This paper presents a highly predictable, low overhead and yet dynamic, memory allocation strategy for embedded systems with scratch-pad memory. A scratch-pad is a fast compiler-m...
Sumesh Udayakumaran, Rajeev Barua
MICRO
2000
IEEE
107views Hardware» more  MICRO 2000»
15 years 4 months ago
An integrated approach to accelerate data and predicate computations in hyperblocks
To exploit increased instruction-level parallelism available in modern processors, we describe the formation and optimization of tracenets, an integrated approach to reducing the ...
Alexandre E. Eichenberger, Waleed Meleis, Suman Ma...
ISTA
2007
15 years 6 months ago
Analytical data modeling of investment project financing process
: The present work is devoted to the research of investment projects’ financing issues. Within this paper a data analytical tool for an optimal financing schema computation on th...
Mikhail D. Godlevskiy, Valentina V. Moskalenko, Vl...
MIDDLEWARE
2007
Springer
15 years 11 months ago
New Worker-Centric Scheduling Strategies for Data-Intensive Grid Applications
Distributed computations, dealing with large amounts of data, are scheduled in Grid clusters today using either a task-centric mechanism, or a worker-centric mechanism. Because of ...
Steven Y. Ko, Ramsés Morales, Indranil Gupt...