Sciweavers

5404 search results - page 77 / 1081
» Global Computing for Bioinformatics
Sort
View
168
Voted
BMCBI
2006
166views more  BMCBI 2006»
15 years 3 months ago
bioNMF: a versatile tool for non-negative matrix factorization in biology
Background: In the Bioinformatics field, a great deal of interest has been given to Non-negative matrix factorization technique (NMF), due to its capability of providing new insig...
Alberto D. Pascual-Montano, Pedro Carmona-Saez, Mo...

Presentation
1717views
17 years 2 months ago
Global vs. Local Optimisation Algorithms
A detailed presentation by Yuri Boykov, Daniel Cremers, Vladimir Kolmogorov, at the European Conference on Computer Vision (ECCV) 2006, that shows the difference between local and ...
118
Voted
DNA
2006
Springer
129views Bioinformatics» more  DNA 2006»
15 years 7 months ago
P Systems with Active Membranes Characterize PSPACE
P system is a natural computing model inspired by behavior of living cells and their membranes. We show that (semi-)uniform families of P systems with active membranes can solve i...
Petr Sosík, Alfonso Rodríguez-Pat&oa...
136
Voted
ICCV
2011
IEEE
14 years 3 months ago
Are Spatial and Global Constraints Really Necessary for Segmentation?
Many state-of-the-art segmentation algorithms rely on Markov or Conditional Random Field models designed to enforce spatial and global consistency constraints. This is often accom...
Aurelien Lucchi, Yunpeng Li, Xavier Boix, Kevin Sm...
PG
2007
IEEE
15 years 9 months ago
Practical Global Illumination for Hair Rendering
Both hair rendering and global illumination are known to be computationally expensive, and for this reason we see very few examples using global illumination techniques in hair re...
Cem Yuksel, Ergun Akleman, John Keyser