Sciweavers

7648 search results - page 405 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
191
Voted
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
15 years 7 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
ICMCS
2006
IEEE
130views Multimedia» more  ICMCS 2006»
16 years 26 days ago
Directional Weighting-Based Demosaicking Algorithm for Noisy CFA Environments
Captured CFA data by image sensors like CCD/or CMOS are often corrupted by noises. To produce high quality images acquired by CCD/CMOS digital cameras, the problem of noise needs ...
Hung-Yi Lo, Tsung-Nan Lin, Chih-Lung Hsu, Cheng-hs...
VLSID
1999
IEEE
97views VLSI» more  VLSID 1999»
15 years 11 months ago
Improving Area Efficiency of Residue Number System based Implementation of DSP Algorithms
Residue Number System based applications involve modulo-arithmetic which is typically implemented using look-up-tables (LUTs) for a small value of modulus. In this paper, we prese...
M. N. Mahesh, Satrajit Gupta, Mahesh Mehendale
DAGSTUHL
2004
15 years 8 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
ICPP
1999
IEEE
15 years 11 months ago
Compiler Optimizations for I/O-Intensive Computations
This paper describes transformation techniques for out-of-core programs (i.e., those that deal with very large quantities of data) based on exploiting locality using a combination...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...