Sciweavers

6142 search results - page 305 / 1229
» The Complexity of Partition Functions
Sort
View
BMCBI
2004
93views more  BMCBI 2004»
15 years 6 months ago
Predicting binding sites of hydrolase-inhibitor complexes by combining several methods
Background: Protein-protein interactions play a critical role in protein function. Completion of many genomes is being followed rapidly by major efforts to identify interacting pr...
Taner Z. Sen, Andrzej Kloczkowski, Robert L. Jerni...
COLT
2010
Springer
15 years 4 months ago
Quantum Predictive Learning and Communication Complexity with Single Input
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to a...
Dmitry Gavinsky
TSP
2010
15 years 1 months ago
On the shiftability of dual-tree complex wavelet transforms
The dual-tree complex wavelet transform (DT- WT) is known to exhibit better shift-invariance than the conventional discrete wavelet transform. We propose an amplitude-phase represe...
Kunal Narayan Chaudhury, Michael Unser
ISPD
2007
ACM
128views Hardware» more  ISPD 2007»
15 years 8 months ago
X-architecture placement based on effective wire models
In this paper, we derive the X-half-perimeter wirelength (XHPWL) model for X-architecture placement and explore the effects of three different wire models on X-architecture plac...
Tung-Chieh Chen, Yi-Lin Chuang, Yao-Wen Chang
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
16 years 7 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...