350 search results - page 55 / 70 » Lower and upper bounds on obtaining history independence |
114
click to vote
CNSR
2008
IEEE
15 years 6 months ago
2008
IEEE
Secure communications in UWB based on cryptographic keys generated from channel measurements without a trusted third party have been developed. The fine time resolution of UWB al...
104
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
91
Voted
TWC
2008
14 years 11 months ago
2008
Abstract-- The V-BLAST (vertical Bell Labs layered Space-Time) architecture involves independent coding/decoding per antenna (layer) with equal rate and power per antenna and a fix...
120
click to vote
SIGMOD
2012
ACM
13 years 2 months ago
2012
ACM
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...