1258 search results - page 107 / 252 » Architecture-driven Problem Decomposition |
DATE
2000
IEEE
14 years 1 months ago
2000
IEEE
In this paper we address the problem of designing very high throughput finite state machines (FSMs). The presence of loops in sequential circuits prevents a straightforward and g...
ISMVL
1999
IEEE
14 years 1 months ago
1999
IEEE
In this paper, the theory of information relationships and relationship measures is considered and its application to logic design is discussed. This theory makes operational the ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
1 Recently, great attention was intended toward overcomplete dictionaries and the sparse representations they can provide. In a wide variety of signal processing problems, sparsity...
IJCV
2006
13 years 9 months ago
2006
: Linear subspace analysis (LSA) has become rather ubiquitous in a wide range of problems arising in pattern recognition and computer vision. The essence of these approaches is tha...
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
Most existing work uses dual decomposition and subgradient methods to solve Network Utility Maximization (NUM) problems in a distributed manner, which suffer from slow rate of con...