447 search results - page 22 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
SIAMNUM
2010
14 years 10 months ago
2010
In this paper we develop boundary value methods for detecting Sacker-Sell spectra in discrete time dynamical systems. The algorithms are advancements of earlier methods for comput...
104
Voted
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
Given a point set P R2 , a subset Q P is an -kernel of P if for every slab W containing Q, the (1+)-expansion of W also contains P. We present a data-stream algorithm for mainta...
129
Voted
SAC
2008
ACM
15 years 3 months ago
2008
ACM
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...
144
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
140
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...