Search Results - "De Wolf, R."
-
1
Electrochemical reduction of halogenated aromatic compounds at metal cathodes in acetonitrile
Published in Electrochimica acta (01-02-2020)“…A systematic mapping of the catalytic activity combined with mechanistic tendencies for the electrochemical reduction of aromatic halides has been conducted…”
Get full text
Journal Article -
2
Evaluation of the changes in human milk lipid composition and conformational state with Raman spectroscopy during a breastfeed
Published in Biomedical optics express (01-07-2021)“…Human milk fat forms the main energy source for breastfed infants, and is highly variable in terms of concentration and composition. Understanding the changes…”
Get full text
Journal Article -
3
Algorithmic Clustering of Music Based on String Compression
Published in Computer music journal (01-12-2004)“…All musical pieces are similar, but some are more similar than others. Apart from serving as an infinite source of discussion ("Haydn is just like Mozart-- No,…”
Get full text
Journal Article -
4
Communication complexity lower bounds by polynomials
Published in Proceedings / IEEE Conference on Computational Complexity (01-01-2001)“…The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared…”
Get full text
Journal Article -
5
Communication complexity lower bounds by polynomials
Published in Proceedings 16th Annual IEEE Conference on Computational Complexity (2001)“…The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared…”
Get full text
Conference Proceeding -
6
Quantum algorithms for element distinctness
Published in Proceedings / IEEE Conference on Computational Complexity (2001)“…We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize…”
Get full text
Conference Proceeding Journal Article -
7
Complexity measures and decision tree complexity: a survey
Published in Theoretical computer science (09-10-2002)“…We discuss several complexity measures for Boolean functions: certificate complexity, sensitivity, block sensitivity, and the degree of a representing or…”
Get full text
Journal Article Conference Proceeding -
8
Quantum fingerprinting
Published in Physical review letters (15-10-2001)“…Classical fingerprinting associates with each string a shorter string (its fingerprint), such that any two distinct strings can be distinguished with small…”
Get full text
Journal Article -
9
Characterization of non-deterministic quantum query and quantum communication complexity
Published in Proceedings / IEEE Conference on Computational Complexity (2000)“…It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing…”
Get full text
Conference Proceeding Journal Article -
10
Quantum communication and complexity
Published in Theoretical computer science (25-09-2002)“…In the setting of communication complexity, two distributed parties want to compute a function depending on both their inputs, using as little communication as…”
Get full text
Journal Article -
11
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Published in Journal of computer and system sciences (01-11-2004)“…A locally decodable code (LDC) encodes n-bit strings x in m-bit codewords C( x) in such a way that one can recover any bit x i from a corrupted codeword by…”
Get full text
Journal Article -
12
Human milk fat globule size distributions: Comparison between laser diffraction and 3D confocal laser scanning microscopy
Published in Food research international (01-12-2024)“…[Display omitted] •We introduce a new method to characterize milk fat globule (MFG) size distributions.•The method (3D confocal microscopy, CLSM) is accurate…”
Get full text
Journal Article -
13
De accountant en de kruipruimte
Published in MAB ('s-Gravenhage. Online) (01-01-2004)“…De intensieve toepassing van informatietechnologie door bedrijven en instellingen heeft niet alleen voordelen, maar brengt ook risico’s met zich mee. In dit…”
Get full text
Journal Article -
14
On Computation and Communication with Small Bias
Published in Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) (01-06-2007)“…We present two results for computational models that allow error probabilities close to 1/2. First, most computational complexity classes have an analogous…”
Get full text
Conference Proceeding -
15
Private quantum channels
Published in Annual Symposium on Foundations of Computer Science (2000)“…We investigate how a classical private key can be used by two players, connected by an insecure one-way quantum channel, to perform private communication of…”
Get full text
Conference Proceeding Journal Article -
16
Quantum symmetrically-private information retrieval
Published in Information processing letters (16-05-2004)“…Private information retrieval systems (PIRs) allow a user to extract an item from a database that is replicated over k⩾1 servers, while satisfying various…”
Get full text
Journal Article -
17
Near-Optimal and Explicit Bell Inequality Violations
Published in 2011 IEEE 26th Annual Conference on Computational Complexity (01-06-2011)“…Bell inequality violations correspond to behavior of entangled quantum systems that cannot be simulated classically. We give two new two-player games with Bell…”
Get full text
Conference Proceeding -
18
Quantum lower bounds by polynomials
Published in Annual Symposium on Foundations of Computer Science (1998)“…We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}/sup N/ in the black-box model. We show that,…”
Get full text
Conference Proceeding Journal Article -
19
Quantum and classical strong direct product theorems and optimal time-space tradeoffs
Published in 45th Annual IEEE Symposium on Foundations of Computer Science (2004)“…A strong direct product theorem says that if we want to compute k independent instances of a function, using less than k times the resources needed for one…”
Get full text
Conference Proceeding -
20
Algorithmic clustering of music
Published in Proceedings of the Fourth International Conference onWeb Delivering of Music, 2004. EDELMUSIC 2004 (2004)“…We present a method for hierarchical music clustering, based on compression of strings that represent the music pieces. The method uses no background knowledge…”
Get full text
Conference Proceeding