555 search results - page 54 / 111 » Linear decomposition algorithm for VLSI design applications |
125
click to vote
HPDC
1999
IEEE
15 years 8 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
118
Voted
CORR
2010
Springer
15 years 16 days ago
2010
Springer
The Hopper-Blum (HB) protocol, which uses noised linear parities of a shared key for authentication, has been proposed for light-weight applications such as RFID. Recently, algorit...
145
click to vote
ICCAD
1995
IEEE
15 years 7 months ago
1995
IEEE
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...
149
click to vote
SBCCI
2003
ACM
15 years 9 months ago
2003
ACM
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...
144
click to vote
MP
2010
14 years 10 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...