Sciweavers

4895 search results - page 43 / 979
» Functional Quantum Programming
Sort
View
JMLR
2012
11 years 11 months ago
Learning Fourier Sparse Set Functions
Peter Stobbe, Andreas Krause
LOGCOM
2010
120views more  LOGCOM 2010»
13 years 3 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
IPPS
2007
IEEE
14 years 3 months ago
A global address space framework for locality aware scheduling of block-sparse computations
In this paper, we present a mechanism for automatic management of the memory hierarchy, including secondary storage, in the context of a global address space parallel programming ...
Sriram Krishnamoorthy, Ümit V. Çataly&...
APLAS
2003
ACM
14 years 2 months ago
A Program Inverter for a Functional Language with Equality and Constructors
We present a method for automatic program inversion in a first-order functional programming language. We formalize the transformation and illustrate it with several examples inclu...
Robert Glück, Masahiko Kawabe
COCO
2004
Springer
121views Algorithms» more  COCO 2004»
14 years 2 months ago
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
Sophie Laplante, Frédéric Magniez