2252 search results - page 209 / 451 » Lower Bounds for Dynamic Algorithms |
123
Voted
CSL
2004
Springer
15 years 7 months ago
2004
Springer
It is well known that in an o-minimal hybrid system the continuous and discrete components can be separated, and therefore the problem of finite bisimulation reduces to the same pr...
131
Voted
PODS
2003
ACM
16 years 3 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
117
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
The faulty memory RAM presented by Finocchi and Italiano [1] is a variant of the RAM model where the content of any memory cell can get corrupted at any time, and corrupted cells c...
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Folding an n × n checkerboard pattern from a square of paper that is white on one side and black on the other has been thought for several years to require a paper squar...
155
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...