Sciweavers

993 search results - page 65 / 199
» The Complexity of Probabilistic EL
Sort
View
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 1 months ago
Convergence of stochastic search algorithms to gap-free pareto front approximations
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
Oliver Schütze, Marco Laumanns, Emilia Tantar...
CCS
2011
ACM
12 years 7 months ago
Information-flow types for homomorphic encryptions
We develop a flexible information-flow type system for a range of encryption primitives, precisely reflecting their diverse functional and security features. Our rules enable e...
Cédric Fournet, Jérémy Planul...
BMCBI
2007
124views more  BMCBI 2007»
13 years 8 months ago
A high-accuracy consensus map of yeast protein complexes reveals modular nature of gene essentiality
Background: Identifying all protein complexes in an organism is a major goal of systems biology. In the past 18 months, the results of two genome-scale tandem affinity purificatio...
G. Traver Hart, Insuk Lee, Edward M. Marcotte
IANDC
2008
74views more  IANDC 2008»
13 years 7 months ago
Baire categories on small complexity classes and meager-comeager laws
We introduce two resource-bounded Baire category notions on small complexity classes such as P, QUASIPOLY, SUBEXP and PSPACE and on probabilistic classes such as BPP, which differ...
Philippe Moser
ECCC
2010
122views more  ECCC 2010»
13 years 6 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah