Sciweavers

5608 search results - page 236 / 1122
» On the Theory of Matchgate Computations
Sort
View
RECOMB
2003
Springer
16 years 7 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson
CCS
2009
ACM
16 years 1 months ago
CoSP: a general framework for computational soundness proofs
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
Michael Backes, Dennis Hofheinz, Dominique Unruh
ICAC
2007
IEEE
16 years 29 days ago
Approximation Modeling for the Online Performance Management of Distributed Computing Systems
—A promising method of automating management tasks in computing systems is to formulate them as control or optimization problems in terms of performance metrics. For an online op...
Dara Kusic, Nagarajan Kandasamy, Guofei Jiang
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
16 years 23 days ago
A systemic computation platform for the modelling and analysis of processes with natural characteristics
Computation in biology and in conventional computer architectures seem to share some features, yet many of their important characteristics are very different. To address this, [1]...
Erwan Le Martelot, Peter J. Bentley, R. Beau Lotto
ACMDIS
2004
ACM
16 years 1 days ago
Privacy risk models for designing privacy-sensitive ubiquitous computing systems
Privacy is a difficult design issue that is becoming increasingly important as we push into ubiquitous computing environments. While there is a fair amount of theoretical work on ...
Jason I. Hong, Jennifer D. Ng, Scott Lederer, Jame...