Sciweavers

4716 search results - page 875 / 944
» Tangible functional programming
Sort
View
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 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
15 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
15 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
KBSE
2000
IEEE
15 years 1 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula
IPAS
2008
15 years 8 days ago
Multivariate mathematical morphology and Bayesian classifier application to colour and medical images
Multivariate images are now commonly produced in many applications. If their process is possible due to computers power and new programming languages, theoretical difficulties hav...
Arnaud Garcia, Corinne Vachier, Jean-Paul Vall&eac...