Sciweavers

15073 search results - page 435 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
VLSM
2005
Springer
16 years 28 days ago
Entropy Controlled Gauss-Markov Random Measure Field Models for Early Vision
We present a computationally efficient segmentationrestoration method, based on a probabilistic formulation, for the joint estimation of the label map (segmentation) and the para...
Mariano Rivera, Omar Ocegueda, José L. Marr...
BMCBI
2010
198views more  BMCBI 2010»
15 years 7 months ago
ClustalXeed: a GUI-based grid computation version for high performance and terabyte size multiple sequence alignment
Background: There is an increasing demand to assemble and align large-scale biological sequence data sets. The commonly used multiple sequence alignment programs are still limited...
Taeho Kim, Hyun Joo
BMCBI
2010
121views more  BMCBI 2010»
15 years 4 months ago
Computing DNA duplex instability profiles efficiently with a two-state model: trends of promoters and binding sites
Background: DNA instability profiles have been used recently for predicting the transcriptional start site and the location of core promoters, and to gain insight into promoter ac...
Miriam R. Kantorovitz, Zoi Rapti, Vladimir Gelev, ...
ICPP
1999
IEEE
15 years 11 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward
EC
2000
123views ECommerce» more  EC 2000»
15 years 7 months ago
Embodiment of Evolutionary Computation in General Agents
Holland's Adaptation in Natural and Artificial Systems largely dealt with how systems, comprised of many self-interested entities, can and should adapt as a whole. This semin...
Robert E. Smith, Claudio Bonacina, Paul E. Kearney...