16404 search results - page 3130 / 3281 » A set coverage problem |
127
click to vote
IEEEPACT
2006
IEEE
15 years 10 months ago
2006
IEEE
The address sequence on the processor-memory bus can reveal abundant information about the control flow of a program. This can lead to critical information leakage such as encryp...
140
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
nts etc.), an abstract graph of the deployment area and QoS constraints to generate appropriate logical topologies. WIND starts with the set of network elements to be deployed (Nod...
153
click to vote
ISPASS
2006
IEEE
15 years 10 months ago
2006
IEEE
Applications in Computer Networks often require high throughput access to large data structures for lookup and classification. Many advanced algorithms exist to speed these searc...
137
click to vote
ISPASS
2006
IEEE
15 years 10 months ago
2006
IEEE
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...
138
click to vote
LICS
2006
IEEE
15 years 9 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...