994 search results - page 76 / 199 » Custom Computing Machines for the Set Covering Problem |
131
click to vote
STOC
1993
ACM
15 years 7 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
147
click to vote
BMCBI
2007
15 years 3 months ago
2007
Background: A nanopore detector has a nanometer-scale trans-membrane channel across which a potential difference is established, resulting in an ionic current through the channel ...
127
click to vote
ENTCS
2010
15 years 3 months ago
2010
Component based development allows to build software upon existing components and promises to improve software reuse and reduce costs. To gain reliability of a component based sys...
128
click to vote
COLT
1999
Springer
15 years 7 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
162
click to vote
BMCBI
2008
15 years 3 months ago
2008
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...