Sciweavers

3690 search results - page 253 / 738
» Computation with classical sequents
Sort
View
87
Voted
ASPDAC
2005
ACM
80views Hardware» more  ASPDAC 2005»
15 years 2 months ago
Synthesis of quantum logic circuits
— The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits to the attention...
Vivek V. Shende, Stephen S. Bullock, Igor L. Marko...
PODC
2010
ACM
15 years 2 months ago
Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
Guanfeng Liang, Nitin Vaidya
90
Voted
NIPS
2008
15 years 2 months ago
Efficient Inference in Phylogenetic InDel Trees
Accurate and efficient inference in evolutionary trees is a central problem in computational biology. While classical treatments have made unrealistic site independence assumption...
Alexandre Bouchard-Côté, Michael I. J...
101
Voted
DGCI
2008
Springer
15 years 1 months ago
Optimal Difference Operator Selection
Abstract. Differential operators are essential in many image processing applications. Previous work has shown how to compute derivatives more accurately by examining the image loca...
Peter Veelaert, Kristof Teelen
AIEDAM
2008
127views more  AIEDAM 2008»
15 years 29 days ago
Evolving blackbox quantum algorithms using genetic programming
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter