Abstract— Visualizing software architecture faces the challenges of both data complexity and visual complexity. This paper presents an approach for visualizing software architect...
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
Abstract-- Complexity modeling of spatial-temporal compensations in H.264/AVC decoding is performed by examining a rich set of inter- and intra-prediction modes. Specifically, we s...
A joint rate-distortion-complexity H.264 motion search framework is proposed to balance the encoder’s coding efficiency and complexity in an embedded system environment. Under ...
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...