Sciweavers

13603 search results - page 286 / 2721
» On the Complexity of Computing Treelength
Sort
View
ICIP
2000
IEEE
16 years 7 months ago
Rate-Complexity-Distortion Optimization for Quadtree-Based DCT Coding
In this paper, we study rate-complexity-distortion (R-C-D) tradeoffs for video coding, where we focus on the complexity of computing the inverse DCT. A quadtree coding approach is...
Krisda Lengwehasatit, Antonio Ortega
IPPS
2006
IEEE
16 years 3 days ago
Sim-X: parallel system software for interactive multi-experiment computational studies
Advances in high-performance computing have led to the broad use of computational studies in everyday engineering and scientific applications. A single study may require thousand...
Siu-Man Yau, Eitan Grinspun, Vijay Karamcheti, Den...
PR
2008
90views more  PR 2008»
15 years 6 months ago
Fast computation of geometric moments using a symmetric kernel
This paper presents a novel set of geometric moments with symmetric kernel (SGM) obtained using an appropriate transformation of image coordinates. By using this image transformat...
Chong-Yaw Wee, Paramesran Raveendran, R. Mukundan
ACMIDC
2010
15 years 10 months ago
BeeSim: leveraging wearable computers in participatory simulations with young children
New technologies have enabled students to become active participants in computational simulations of dynamic and complex systems (called Participatory Simulations), providing a &q...
Kylie A. Peppler, Joshua A. Danish, Benjamin Zaitl...
ICIP
2008
IEEE
16 years 7 months ago
Complexity modeling of H.264 entropy decoding
This paper models the complexity consumption of entropy decoding in a H.264 decoder, which includes many modes such as fix-length code (FLC), variable-length code (ExpGolomb code ...
Zhan Ma, Zhongbo Zhang, Yao Wang