Sciweavers

6568 search results - page 394 / 1314
» Reducing the Complexity of Reductions
Sort
View
DFT
2005
IEEE
132views VLSI» more  DFT 2005»
15 years 9 months ago
Low Power BIST Based on Scan Partitioning
A built-in self-test (BIST) scheme is presented which both reduces overhead for detecting random-pattern-resistant (r.p.r.) faults as well as reduces power consumption during test...
Jinkyu Lee, Nur A. Touba
DCC
2004
IEEE
15 years 11 months ago
Model Based Optimal Bit Allocation
Modeling of the operational rate-distortion characteristics of a signal can significantly reduce the computational complexity of an optimal bit allocation algorithm. In this repor...
Nasir Rajpoot
IV
2005
IEEE
131views Visualization» more  IV 2005»
16 years 1 months ago
A Framework for Visualising Large Graphs
Visualising large graphs faces the challenges of both data complexity and visual complexity. This paper presents a framework for visualising large graphs that reduces data complex...
Wanchun Li, Seok-Hee Hong, Peter Eades
ICASSP
2011
IEEE
14 years 11 months ago
Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomial-complexity solvability and algorithmic developments
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
Anastasios T. Kyrillidis, George N. Karystinos
CPAIOR
2005
Springer
16 years 1 months ago
Symmetry Breaking and Local Search Spaces
The effects of combining search and modelling techniques can be complex and unpredictable, so guidelines are very important for the design and development of effective and robust s...
Steven David Prestwich, Andrea Roli