Sciweavers

11716 search results - page 363 / 2344
» Computable symbolic dynamics
Sort
View
SODA
2008
ACM
106views Algorithms» more  SODA 2008»
15 years 8 months ago
Exact and efficient 2D-arrangements of arbitrary algebraic curves
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
Arno Eigenwillig, Michael Kerber
ISMB
2000
15 years 8 months ago
Accelerating Protein Classification Using Suffix Trees
Position-specific scoring matrices have been used extensively to recognize highly conserved protein regions. We present a method for accelerating these searches using a suffix tre...
Bogdan Dorohonceanu, Craig G. Nevill-Manning
CSDA
2006
142views more  CSDA 2006»
15 years 6 months ago
Automatic approximation of the marginal likelihood in non-Gaussian hierarchical models
Fitting of non-Gaussian hierarchical random effects models by approximate maximum likelihood can be made automatic to the same extent that Bayesian model fitting can be automated ...
Hans J. Skaug, David A. Fournier
CC
2010
Springer
117views System Software» more  CC 2010»
15 years 4 months ago
Efficiently Certifying Non-Integer Powers
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
Erich Kaltofen, Mark Lavin
ISORC
2011
IEEE
14 years 10 months ago
A Time-Predictable Object Cache
—Static cache analysis for data allocated on the heap is practically impossible for standard data caches. We propose a distinct object cache for heap allocated data. The cache is...
Martin Schoeberl