151 search results - page 16 / 31 » A Lower Bound on List Size for List Decoding |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
MANSCI
2010
13 years 5 months ago
2010
: Do firms neglect competition when making entry decisions? Using a dataset of 14,973 eBay auctions this paper addresses this question analyzing the time of day at which sellers se...
IPL
2000
13 years 7 months ago
2000
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P. The estimates are based on applying tree estimation methods ...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...