Sciweavers

6568 search results - page 299 / 1314
» Reducing the Complexity of Reductions
Sort
View
VL
2005
IEEE
107views Visual Languages» more  VL 2005»
16 years 12 days ago
Navigating Software Architectures with Constant Visual Complexity
Abstract— Visualizing software architecture faces the challenges of both data complexity and visual complexity. This paper presents an approach for visualizing software architect...
Wanchun Li, Peter Eades, Seok-Hee Hong
IWPEC
2004
Springer
16 years 5 days ago
Packing Edge Disjoint Triangles: A Parameterized View
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...
Luke Mathieson, Elena Prieto, Peter Shaw
ICIP
2008
IEEE
16 years 8 months ago
Complexity modeling of spatial and temporal compensations in H.264/AVC decoding
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...
Szu-Wei Lee, C. C. Jay Kuo
ICMCS
2006
IEEE
151views Multimedia» more  ICMCS 2006»
16 years 26 days ago
Joint Rate-Distortion-Complexity Optimization for H.264 Motion Search
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 ...
Yu Hu, Qing Li, Siwei Ma, C. C. Jay Kuo
CSCLP
2005
Springer
16 years 11 days ago
Complexity Analysis of Heuristic CSP Search Algorithms
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...
Igor Razgon