Sciweavers

1431 search results - page 283 / 287
» The complexity of random ordered structures
Sort
View
BMCBI
2007
166views more  BMCBI 2007»
13 years 7 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour
JRTIP
2008
118views more  JRTIP 2008»
13 years 7 months ago
Custom parallel caching schemes for hardware-accelerated image compression
Abstract In an effort to achieve lower bandwidth requirements, video compression algorithms have become increasingly complex. Consequently, the deployment of these algorithms on Fi...
Su-Shin Ang, George A. Constantinides, Wayne Luk, ...
TIP
2008
153views more  TIP 2008»
13 years 7 months ago
Generalized Flooding and Multicue PDE-Based Image Segmentation
Image segmentation remains an important, but hard-to-solve, problem since it appears to be application dependent with usually no a priori information available regarding the image ...
Anastasia Sofou, Petros Maragos
BMCBI
2005
142views more  BMCBI 2005»
13 years 7 months ago
High performance workflow implementation for protein surface characterization using grid technology
Background: This study concerns the development of a high performance workflow that, using grid technology, correlates different kinds of Bioinformatics data, starting from the ba...
Ivan Merelli, Giulia Morra, Daniele D'Agostino, An...
AI
2002
Springer
13 years 7 months ago
The size distribution for Markov equivalence classes of acyclic digraph models
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
Steven B. Gillispie, Michael D. Perlman