Sciweavers

1022 search results - page 147 / 205
» Logspace Complexity of Functions and Structures
Sort
View
BMCBI
2007
124views more  BMCBI 2007»
13 years 10 months ago
Analysis on multi-domain cooperation for predicting protein-protein interactions
Background: Domains are the basic functional units of proteins. It is believed that protein-protein interactions are realized through domain interactions. Revealing multi-domain c...
Rui-Sheng Wang, Yong Wang, Ling-Yun Wu, Xiang-Sun ...
JCSS
2008
138views more  JCSS 2008»
13 years 10 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
BMCBI
2005
112views more  BMCBI 2005»
13 years 10 months ago
Integration of the Gene Ontology into an object-oriented architecture
Background: To standardize gene product descriptions, a formal vocabulary defined as the Gene Ontology (GO) has been developed. GO terms have been categorized into biological proc...
Daniel Shegogue, W. Jim Zheng
CORR
2000
Springer
116views Education» more  CORR 2000»
13 years 10 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
14 years 3 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen