Sciweavers

1522 search results - page 37 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
CCA
2009
Springer
14 years 2 months ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
Martin Ziegler
ACISP
2001
Springer
14 years 6 days ago
Private Information Retrieval Based on the Subgroup Membership Problem
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
Akihiro Yamamura, Taiichi Saito
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
BIBM
2010
IEEE
157views Bioinformatics» more  BIBM 2010»
13 years 5 months ago
Decomposing PPI networks for complex discovery
Abstract--Protein complexes are important for understanding principles of cellular organization and functions. With the availability of large amounts of high-throughput proteinprot...
Guimei Liu, Chern Han Yong, Limsoon Wong, Hon Nian...
AIPS
2009
13 years 8 months ago
Extended Goals for Composing Services
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
Eirini Kaldeli, Alexander Lazovik, Marco Aiello