Sciweavers

1487 search results - page 70 / 298
» The Computational Complexity of Link Building
Sort
View
ICCS
2001
Springer
15 years 6 months ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
Eun-Jin Im, Katherine A. Yelick
ICDE
2009
IEEE
129views Database» more  ICDE 2009»
16 years 3 months ago
Computing Distance Histograms Efficiently in Scientific Databases
Abstract-- Particle simulation has become an important research tool in many scientific and engineering fields. Data generated by such simulations impose great challenges to databa...
Yi-Cheng Tu, Shaoping Chen, Sagar Pandit
IPPS
2007
IEEE
15 years 7 months ago
Enhancing Portability of HPC Applications across High-end Computing Platforms
Fast hardware turnover in supercomputing centers, stimulated by rapid technological progress, results in high heterogeneity among HPC platforms, and necessitates that applications...
Magdalena Slawiñska, Jaroslaw Slawinski, Da...
ESOP
2007
Springer
15 years 7 months ago
Computing Procedure Summaries for Interprocedural Analysis
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
Sumit Gulwani, Ashish Tiwari
CICLING
2005
Springer
15 years 7 months ago
A Computational Model of the Spanish Clitic System
In this paper a computational model of the Spanish clitic system is presented. In this model clitic pronouns receive a dual analysis in which enclitics are considered inflexions wh...
Luis Alberto Pineda, Ivan V. Meza