107 search results - page 15 / 22 » Polynomially Bounded Matrix Interpretations |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
92
Voted
RECOMB
2004
Springer
15 years 9 months ago
2004
Springer
The prediction of translation initiation sites (TISs) in eukaryotic mRNAs has been a challenging problem in computational molecular biology. In this paper, we present a new algori...
STOC
2001
ACM
15 years 9 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
IPMI
2009
Springer
15 years 10 months ago
2009
Springer
The evaluation of the quality of segmentations of an image, and the assessment of intra- and inter-expert variability in segmentation performance, has long been recognized as a dic...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...