623 search results - page 68 / 125 » Improved construction for pooling design |
176
click to vote
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
132
click to vote
CHI
2005
ACM
16 years 6 months ago
2005
ACM
The development of programming skills is a motivating issue in computer science. Programming languages have been increasingly used to map end-users needs and mental models. The nu...
143
click to vote
DCC
2005
IEEE
16 years 5 months ago
2005
IEEE
Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions (...
153
click to vote
ICCAD
2008
IEEE
16 years 2 months ago
2008
IEEE
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
203
click to vote
RTSS
2005
IEEE
15 years 11 months ago
2005
IEEE
Scratchpad memory is a popular choice for on-chip storage in real-time embedded systems. The allocation of code/data to scratchpad memory is performed at compile time leading to p...