Sciweavers

1094 search results - page 88 / 219
» On Computing Explanations in Argumentation
Sort
View
JOC
2002
76views more  JOC 2002»
15 years 5 months ago
A Note on Negligible Functions
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
Mihir Bellare
JASIS
2010
148views more  JASIS 2010»
15 years 23 days ago
Social validation of collective annotations: Definition and experiment
People taking part in argumentativedebates through collective annotationsface a highly cognitive task when trying to estimate the group's global opinion. In order to reduce t...
Guillaume Cabanac, Max Chevalier, Claude Chrisment...
HPDC
1997
IEEE
15 years 10 months ago
PARDIS: A Parallel Approach to CORBA
This paper describes PARDIS, a system containing explicit support for interoperability of PARallel DIStributed applications. PARDIS is based on the Common Object Request Broker Ar...
Katarzyna Keahey, Dennis Gannon
IUI
1993
ACM
15 years 10 months ago
Wizard of Oz studies: why and how
We discuss current approaches to the development of natural language dialogue systems, and claim that they do not sufficiently consider the unique qualities of man-machine intera...
Nils Dahlbäck, Arne Jönsson, Lars Ahrenb...
JASIS
2008
123views more  JASIS 2008»
15 years 6 months ago
Democratic theory in library information science
: A recent article by Joseph Buschman regrets that democratic theory is an unfinished idea. The argument appears to assume an essential relationship between library information sci...
Michael K. Buckland