328 search results - page 33 / 66 » Deterministic k-set structure |
115
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
109
Voted
SIGMOD
2001
ACM
16 years 3 months ago
2001
ACM
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
136
Voted
IWINAC
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, the ways of optimising a Particle Filter video tracking algorithm are investigated. The optimisation scheme discussed in this work is based on hybridising a Particle...
120
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— This paper introduces stochastic port-Hamiltonian systems and clarifies some of their properties. Stochastic portHamiltonian systems are extension of port-Hamiltonian systems ...
145
Voted
SSDBM
2007
IEEE
15 years 10 months ago
2007
IEEE
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...