Sciweavers

2335 search results - page 356 / 467
» Functional Differentiation of Computer Programs
Sort
View
ICALP
2005
Springer
15 years 8 months ago
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
Jeff Ford, Anna Gál
ICALP
2005
Springer
15 years 8 months ago
Simple Extractors via Constructions of Cryptographic Pseudo-random Generators
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
Marius Zimand
IFIP
2005
Springer
15 years 8 months ago
Numerical Approximation of a Control Problem for Advection-Diffusion Processes
Two different approaches are proposed to enhance the efficiency of the numerical resolution of optimal control problems governed by a linear advection– diffusion equation. In ...
Alfio Quarteroni, Gianluigi Rozza, L. Dedè,...
FMCO
2004
Springer
112views Formal Methods» more  FMCO 2004»
15 years 7 months ago
Probabilistic Linda-Based Coordination Languages
Abstract. Coordination languages are intended to simplify the development of complex software systems by separating the coordination aspects of an application from its computation ...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
ICALP
2004
Springer
15 years 7 months ago
Quantum Query Complexity of Some Graph Problems
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
Christoph Dürr, Mark Heiligman, Peter H&oslas...