5100 search results - page 586 / 1020 » The Linear Complexity of a Graph |
191
click to vote
ICCD
2004
IEEE
16 years 3 months ago
2004
IEEE
This paper presents a novel approach to reducing the complexity of the transient linear circuit analysis for a hybrid structured clock network. Topology reduction is first used to...
176
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Many computer vision problems rely on computing histogram-based objective functions with a sliding window. A main limiting factor is the high computational cost. Existing computat...
151
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— A geometric decoding technique for finite lattices was presented by Seethaler et al. for flat-fading multiple-input multiple-output channels in the case of linear modulations...
151
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we investigate how to obtain high-level adaptivity on complex scientific applications such as Finite Element (FE) simulators by building an adaptive version of thei...
198
click to vote
HPCC
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. Automatic execution time prediction of the Grid applications plays a critical role in making the pervasive Grid more reliable and predictable. However, automatic executio...