4007 search results - page 300 / 802 » Computation with imprecise probabilities |
123
click to vote
VLSID
2007
IEEE
16 years 5 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
125
click to vote
PERCOM
2006
ACM
16 years 4 months ago
2006
ACM
Abstract. We propose a novel mechanism for authentication of queries in a sensor network in case these queries are flooded. In our protocol, the base station appends an authenticat...
121
click to vote
LATIN
2010
Springer
15 years 11 months ago
2010
Springer
We study the error robustness of tilings of the plane. The fundamental question is the following: given a tileset, what happens if we allow a small probability of errors? Are the o...
128
click to vote
ICC
2008
IEEE
15 years 11 months ago
2008
IEEE
—An improved SINR metric is proposed for the random beamforming scheme introduced by Sharif and Hassibi, when the channel observation used to compute the SINR is known to be nois...
112
click to vote
CSR
2007
Springer
15 years 11 months ago
2007
Springer
We propose a simple modification of a well-known Random Walk algorithm for solving the Satisfiability problem and analyze its performance on random CNFs with a planted solution. ...