278 search results - page 17 / 56 » Algorithmic randomness and monotone complexity on product sp... |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
ASMTA
2008
Springer
13 years 10 months ago
2008
Springer
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
ESA
2007
Springer
14 years 2 months ago
2007
Springer
We present an algorithm for finding frequent elements in a stream where the arrivals are not bursty. Depending on the amount of burstiness in the stream our algorithm detects elem...
WADS
2009
Springer
14 years 3 months ago
2009
Springer
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
VLDB
2007
ACM
14 years 2 months ago
2007
ACM
Testing a database engine has been and continues to be a challenging task. The space of possible SQL queries along with their possible access paths is practically unbounded. Moreo...