3898 search results - page 508 / 780 » On the Bit Extraction Problem |
169
click to vote
IPPS
2009
IEEE
16 years 26 days ago
2009
IEEE
A well-known problem in P2P systems is freeriding, where users do not share content if there is no incentive to do so. In this paper, we distinguish lazy freeriders that are merel...
152
click to vote
ICC
2008
IEEE
16 years 20 days ago
2008
IEEE
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...
162
click to vote
ICCCN
2008
IEEE
16 years 19 days ago
2008
IEEE
—The problem of designing high capacity and high bit rate IP-over-WDM networks, which can provide uninterrupted service in the presence of network equipment failures, continues t...
157
click to vote
QEST
2008
IEEE
16 years 18 days ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
174
click to vote
WCNC
2008
IEEE
16 years 17 days ago
2008
IEEE
—Iterative K-best sphere detection (SD) and channel decoding is appealing, since it is capable of achieving a nearmaximum-a-posteriori (MAP) performance at a low complexity. Howe...