Sciweavers

9 search results - page 1 / 2
» A simple and efficient kinetic spanner
Sort
View
COMPGEOM
2008
ACM
13 years 6 months ago
A simple and efficient kinetic spanner
We present a kinetic data structure for maintaining a (1+ )-spanner of size O(n/2 ) for a set of n moving points in the plane. Assuming the trajectories of the points can be descr...
Mohammad Ali Abam, Mark de Berg, Joachim Gudmundss...
SODA
2001
ACM
126views Algorithms» more  SODA 2001»
13 years 6 months ago
Static and kinetic geometric spanners with applications
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...
Menelaos I. Karavelas, Leonidas J. Guibas
BMCBI
2007
102views more  BMCBI 2007»
13 years 4 months ago
qPIPSA: Relating enzymatic kinetic parameters and interaction fields
Background: The simulation of metabolic networks in quantitative systems biology requires the assignment of enzymatic kinetic parameters. Experimentally determined values are ofte...
Razif R. Gabdoulline, Matthias Stein, Rebecca C. W...
SAC
2008
ACM
13 years 4 months ago
Bayesian inference for a discretely observed stochastic kinetic model
The ability to infer parameters of gene regulatory networks is emerging as a key problem in systems biology. The biochemical data are intrinsically stochastic and tend to be observ...
Richard J. Boys, Darren J. Wilkinson, Thomas B. L....
COMPGEOM
2007
ACM
13 years 8 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann