Sciweavers

4743 search results - page 880 / 949
» Introduction to Functional Programming
Sort
View
STACS
1999
Springer
14 years 2 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
ICCAD
1997
IEEE
112views Hardware» more  ICCAD 1997»
14 years 2 months ago
Circuit optimization via adjoint Lagrangians
The circuit tuning problem is best approached by means of gradient-based nonlinear optimization algorithms. For large circuits, gradient computation can be the bottleneck in the o...
Andrew R. Conn, Ruud A. Haring, Chandramouli Viswe...
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
14 years 1 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
FOIKS
2006
Springer
14 years 1 months ago
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
Ian Horrocks, Andrei Voronkov
ESAW
2000
Springer
14 years 1 months ago
Models of Coordination
While software is becoming decomposed in more and more finegrained entities, the interactions amongst those become of major importance. While methodologies for building such compon...
Robert Tolksdorf