Sciweavers

108 search results - page 4 / 22
» Achieving efficient register allocation via parallelism
Sort
View
IPPS
2009
IEEE
14 years 2 months ago
High-order stencil computations on multicore clusters
Stencil computation (SC) is of critical importance for broad scientific and engineering applications. However, it is a challenge to optimize complex, highorder SC on emerging clus...
Liu Peng, Richard Seymour, Ken-ichi Nomura, Rajiv ...
ICC
2007
IEEE
111views Communications» more  ICC 2007»
14 years 2 months ago
Computationally Efficient Optimal Discrete Bit Allocation for Medium and High Target Bit Rate DMT Transmissions
—A computationally efficient optimal discrete bit allocation algorithm is proposed for medium and high target bit rate discrete multitone (DMT) transmissions. Unlike conventional...
Li-ping Zhu, Xiaofeng Zhong, Yan Yao, Shi-wei Dong...
ICASSP
2011
IEEE
12 years 11 months ago
Multi-graph regularization for efficient delivery of user generated content in online social networks
We present a methodology for enhancing the delivery of usergenerated content in online social networks. To this end, we first regularize the social graph via node capacity and li...
Jacob Chakareski
MICRO
2008
IEEE
107views Hardware» more  MICRO 2008»
14 years 2 months ago
A distributed processor state management architecture for large-window processors
— Processor architectures with large instruction windows have been proposed to expose more instruction-level parallelism (ILP) and increase performance. Some of the proposed arch...
Isidro Gonzalez, Marco Galluzzi, Alexander V. Veid...
CGI
2004
IEEE
13 years 11 months ago
Range Image Registration via Probability Field
This paper presents a powerful variant of the ICP (Iterative Closest Point) algorithm for registering range images using a probability field. The probability field (p-field) repre...
Haitao Zhang, Olaf A. Hall-Holt, Arie E. Kaufman