Sciweavers

827 search results - page 58 / 166
» The Complexity of Probabilistic Lobbying
Sort
View
BIBM
2010
IEEE
139views Bioinformatics» more  BIBM 2010»
14 years 11 months ago
Scalable, updatable predictive models for sequence data
The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...
Neeraj Koul, Ngot Bui, Vasant Honavar
JOC
2010
129views more  JOC 2010»
14 years 8 months ago
Discrete Logarithm Problems with Auxiliary Inputs
Let g be an element of prime order p in an abelian group and let Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, the secret key can be computed de...
Jung Hee Cheon
BMCBI
2007
124views more  BMCBI 2007»
15 years 2 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»
15 years 2 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»
15 years 16 days 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