457 search results - page 68 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
PODS
2001
ACM
14 years 7 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— We consider a collocated wireless network where all links contend for a given channel and each link can hear others’ transmissions. Due to channel fading, the link condition ...
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In the standard general-adversary model for multi-party protocols, a global adversary structure is given, and every party must trust in this particular structure. We intr...
ER
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...