740 search results - page 81 / 148 » Lower bounds for Buchsbaum* complexes |
184
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
181
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Outage and error rate performance of the ordered BLAST with more than 2 transmit antennas is evaluated for i.i.d. Rayleigh fading channels. A number of lower and upper bounds on th...
159
click to vote
FOCS
2008
IEEE
16 years 19 days ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
163
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
196
click to vote
MST
2011
15 years 1 months ago
2011
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...