365 search results - page 36 / 73 » Achieving accurate and context-sensitive timing for code opt... |
STOC
2004
ACM
14 years 9 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—In IEEE 802.22 Wireless Regional Area Networks (WRANs), each Base Station (BS) solves a complex resource allocation problem of simultaneously determining the channel to reuse, p...
MICRO
1991
IEEE
14 years 11 days ago
1991
IEEE
This paper examines two alternative approaches to supporting code scheduling for multiple-instruction-issue processors. One is to provide a set of non-trapping instructions so tha...
GLOBECOM
2006
IEEE
14 years 2 months ago
2006
IEEE
We investigate a cooperative communications scheme with N parallel relays, where both the transmissions from the source to the relays and from the relays to the destination use fo...
NETWORKING
2008
13 years 10 months ago
2008
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...