2635 search results - page 255 / 527 » Computing multihomogeneous resultants using straight-line pr... |
189
click to vote
ARCS
2009
Springer
16 years 1 months ago
2009
Springer
The disparity between microprocessor clock frequencies and memory latency is a primary reason why many demanding applications run well below peak achievable performance. Software c...
167
click to vote
TCC
2010
Springer
16 years 1 months ago
2010
Springer
A number of works have investigated using tamper-proof hardware tokens as tools to achieve a variety of cryptographic tasks. In particular, Goldreich and Ostrovsky considered the ...
286
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
131
click to vote
ASAP
2007
IEEE
16 years 25 days ago
2007
IEEE
We present a memory efficient, practical, systolic, parallel architecture for the complete 0/1 knapsack dynamic programming problem, including backtracking. This problem was inte...
175
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Resource constrained systems often are programmed using an eventbased model. Many applications do not lend themselves well to an event-based approach, but preemptive mult...