Sciweavers

17 search results - page 4 / 4
» An Algebra of Scans
Sort
View
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 11 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 11 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite