2095 search results - page 320 / 419 » Improved pebbling bounds |
172
click to vote
CGO
2007
IEEE
16 years 20 days ago
2007
IEEE
Emerging microprocessors offer unprecedented parallel computing capabilities and deeper memory hierarchies, increasing the importance of loop transformations in optimizing compile...
136
click to vote
FOCS
2007
IEEE
16 years 20 days ago
2007
IEEE
Broadcast among n parties in the presence of t ≥ n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI an...
150
click to vote
FOCS
2007
IEEE
16 years 20 days ago
2007
IEEE
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
156
click to vote
FOCS
2007
IEEE
16 years 20 days ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
155
click to vote
ICC
2007
IEEE
16 years 20 days ago
2007
IEEE
—In this paper the Cramér-Rao lower bound (CRLB) of an ultra-wideband (UWB) pulse amplitude modulated (PAM) signal with time hopping (TH) code is derived for the practical case ...