Sciweavers

357 search results - page 30 / 72
» Is Computational Complexity a Barrier to Manipulation
Sort
View
BMCBI
2010
106views more  BMCBI 2010»
15 years 6 months ago
A computational evaluation of over-representation of regulatory motifs in the promoter regions of differentially expressed genes
Background: Observed co-expression of a group of genes is frequently attributed to co-regulation by shared transcription factors. This assumption has led to the hypothesis that pr...
Guofeng Meng, Axel Mosig, Martin Vingron
ICN
2005
Springer
15 years 11 months ago
Discovery and Routing in the HEN Heterogeneous Peer-to-Peer Network
Network infrastructures are nowadays getting more and more complex as security considerations and technical needs like network address translation are blocking traffic and protocol...
Tim Schattkowsky
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 5 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
CCGRID
2009
IEEE
15 years 9 months ago
Experiment and Workflow Management Using Cyberaide Shell
In recent years the power of Grid computing has grown exponentially through the development of advanced middleware systems. While usage has increased, the penetration of Grid compu...
Gregor von Laszewski, Andrew J. Younge, Xi He, Kum...
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
15 years 11 months ago
Lifting techniques for triangular decompositions
We present lifting techniques for triangular decompositions of zero-dimensional varieties, that extend the range of the previous methods. We discuss complexity aspects, and report...
Xavier Dahan, Marc Moreno Maza, Éric Schost...