32 search results - page 4 / 7 » On the Complexity of the Montes Ideal Factorization Algorith... |
COMPGEOM
1993
ACM
13 years 11 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
BMCBI
2007
13 years 7 months ago
2007
Background: Answers to several fundamental questions in statistical genetics would ideally require knowledge of the ancestral pedigree and of the gene flow therein. A few examples...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
—A major performance-limiting factor in terrestrial optical wireless (OW) systems is turbulence-induced fading. Exploiting the additional degrees of freedom in the spatial dimens...
SIPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Stochastic decoding is a new alternative method for low complexity decoding of error-correcting codes. This paper presents the first hardware architecture for stochastic decoding...
CVPR
2000
IEEE
14 years 9 months ago
2000
IEEE
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...