Sciweavers

2703 search results - page 207 / 541
» Optimizing memory transactions
Sort
View
141
Voted
ICCS
2001
Springer
15 years 8 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
134
Voted
ICMCS
1999
IEEE
113views Multimedia» more  ICMCS 1999»
15 years 8 months ago
Optimally Ensured Interactive Service in Distributed Multimedia Presentation Systems
In this paper, we develop a new service to support optimally ensured user interactions with minimum latency in interactive distributed multimedia presentation environments. The no...
Markus Mielke, Aidong Zhang
139
Voted
ICCV
2007
IEEE
16 years 5 months ago
Globally Optimal Image Segmentation with an Elastic Shape Prior
So far global optimization techniques have been developed independently for the tasks of shape matching and image segmentation. In this paper we show that both tasks can in fact b...
Thomas Schoenemann, Daniel Cremers
122
Voted
IPPS
2006
IEEE
15 years 9 months ago
An experimental study of optimizing bioinformatics applications
As bioinformatics is an emerging application of high performance computing, this paper first evaluates the memory performance of several representative bioinformatics application...
Guangming Tan, Lin Xu, Shengzhong Feng, Ninghui Su...
ICDT
2001
ACM
162views Database» more  ICDT 2001»
15 years 8 months ago
Algebraic Rewritings for Optimizing Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in query optimization, data integration, data warehousing etc. Query rewriting in relational databases ...
Gösta Grahne, Alex Thomo