5 search results - page 1 / 1 » The Bit Probe Complexity Measure Revisited |
STACS
1993
Springer
13 years 11 months ago
1993
Springer
STACS
2001
Springer
13 years 11 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
ESA
1999
Springer
13 years 11 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
SIGMETRICS
2008
ACM
13 years 6 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
ICNP
2007
IEEE
14 years 1 months ago
2007
IEEE
—Voice over WiFi (VoWiFi) will soon be the main alternative to cellular phones. Providing a satisfactory user experience remains difficult, however. We focus on Call Admission C...