Sciweavers

690 search results - page 22 / 138
» Multi-Agent Only Knowing
Sort
View
CC
2012
Springer
243views System Software» more  CC 2012»
12 years 4 months ago
Sambamba: A Runtime System for Online Adaptive Parallelization
Abstract. How can we exploit a microprocessor as efficiently as possible? The “classic” approach is static optimization at compile-time, optimizing a program for all possible u...
Kevin Streit, Clemens Hammacher, Andreas Zeller, S...
AMR
2007
Springer
167views Multimedia» more  AMR 2007»
14 years 2 months ago
Ontology: Use and Abuse
This paper is a critical analysis of the use of ontology as an instrument to specify the semantics of a document. The paper argue that not only is a logic of the type used in ontol...
Simone Santini
TSD
2007
Springer
14 years 2 months ago
The Effect of Lexicon Composition in Pronunciation by Analogy
Abstract. Pronunciation by analogy (PbA) is a data-driven approach to phonetic transcription that generates pronunciations for unknown words by exploiting the phonological knowledg...
Tasanawan Soonklang, Robert I. Damper, Yannick Mar...
ICLA
2009
Springer
14 years 3 months ago
Instantial Relevance in Polyadic Inductive Logic
Abstract. We show that under the assumptions of Spectrum Exchangeability and Language Invariance the so called Only Rule, a principle of instantial relevance previously know for un...
Jürgen Landes, Jeff B. Paris, Alena Vencovsk&...
EUROCRYPT
2010
Springer
14 years 1 months ago
Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...
Rafael Pass, Hoeteck Wee