Sciweavers

618 search results - page 115 / 124
» Computational Models of Natural Language Argument
Sort
View
JSYML
2010
107views more  JSYML 2010»
13 years 5 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
CALCO
2009
Springer
138views Mathematics» more  CALCO 2009»
14 years 1 months ago
Kleene Monads: Handling Iteration in a Framework of Generic Effects
Abstract. Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of ...
Sergey Goncharov, Lutz Schröder, Till Mossako...
ICALP
2009
Springer
14 years 7 months ago
External Sampling
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...
AICT
2006
IEEE
163views Communications» more  AICT 2006»
14 years 24 days ago
A Methodology for Searching Reusable Business Processes
Web Services are becoming the prominent paradigm for distributed computing and electronic businesses. This makes natural the extension of the concepts at the base of the workflow ...
Francesco Calabrese, Giovanni Di Dio, Anna Rita Fa...
CSFW
2006
IEEE
14 years 23 days ago
Decentralized Robustness
Robustness links confidentiality and integrity properties of a computing system and has been identified as a useful property for characterizing and enforcing security. Previous ...
Stephen Chong, Andrew C. Myers