Sciweavers

971 search results - page 16 / 195
» Comparative Analysis of Arithmetic Coding Computational Comp...
Sort
View
APL
1998
ACM
14 years 17 hour ago
Reducing computational complexity with array predicates
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
Robert Bernecky
GISCIENCE
2004
Springer
130views GIS» more  GISCIENCE 2004»
14 years 1 months ago
Comparing Exact and Approximate Spatial Auto-regression Model Solutions for Spatial Data Analysis
The spatial auto-regression (SAR) model is a popular spatial data analysis technique, which has been used in many applications with geo-spatial datasets. However, exact solutions f...
Baris M. Kazar, Shashi Shekhar, David J. Lilja, Ra...
ISSTA
2010
ACM
13 years 9 months ago
Analysis of invariants for efficient bounded verification
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
Juan P. Galeotti, Nicolás Rosner, Carlos L&...
ICIP
2005
IEEE
14 years 9 months ago
System analysis of VLSI architecture for motion-compensated temporal filtering
The Motion-Compensated Temporal Filtering (MCTF) is an innovative prediction scheme for video coding and has become the core technology of the coming video coding standard, MPEG21...
Ching-Yeh Chen, Chao-Tsung Huang, Yi-Hua Chen, Chu...
PPOPP
1999
ACM
14 years 2 days ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard