Sciweavers

249 search results - page 17 / 50
» Geometry and the complexity of matrix multiplication
Sort
View
ICCD
2007
IEEE
121views Hardware» more  ICCD 2007»
14 years 6 months ago
Fast power network analysis with multiple clock domains
This paper proposes an efficient analysis flow and an algorithm to identify the worst case noise for power networks with multiple clock domains. First, we apply the Laplace transf...
Wanping Zhang, Ling Zhang, Rui Shi, He Peng, Zhi Z...
SIGGRAPH
1993
ACM
14 years 1 months ago
Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments
We describe an adaptive display algorithm for interactive frame rates during visualization of very complex virtual environments. The algorithm relies upon a hierarchical model rep...
Thomas A. Funkhouser, Carlo H. Séquin
DAC
2009
ACM
14 years 10 months ago
A direct integral-equation solver of linear complexity for large-scale 3D capacitance and impedance extraction
State-of-the-art integral-equation-based solvers rely on techniques that can perform a matrix-vector multiplication in O(N) complexity. In this work, a fast inverse of linear comp...
Wenwen Chai, Dan Jiao, Cheng-Kok Koh
SPAA
2006
ACM
14 years 2 months ago
The cache complexity of multithreaded cache oblivious algorithms
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
Matteo Frigo, Volker Strumpen
WCNC
2008
IEEE
14 years 3 months ago
Simulation of Doubly-Selective Compound K Fading Channels for Mobile-to-Mobile Communications
A computer simulation model is proposed for discretetime doubly-selective compound-K fading channel. It first generates multiple independent mobile-to-mobile Rayleigh fading Chan...
Yuan Liu, Jian Zhang, Yahong Rosa Zheng