Sciweavers

1818 search results - page 166 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
123
Voted
AIR
2004
132views more  AIR 2004»
15 years 3 months ago
Sarcasm, Deception, and Stating the Obvious: Planning Dialogue without Speech Acts
This paper presents an alternative to the `speech acts with STRIPS' approach to implementing dialogue: a fully implemented AI planner which generates and analyses the semantic...
Debora Field, Allan Ramsay
COLING
2002
15 years 3 months ago
A Complete Integrated NLG System Using AI and NLU Tools
A standard architecture for an NLG system has been defined in (Reiter and Dale, 2000). Their work describes the modularization of an NLG system and the tasks of each module. Howev...
Laurence Danlos, Adil El Ghali
DCC
2000
IEEE
15 years 3 months ago
Discrete Logarithms: The Past and the Future
The first practical public key cryptosystem to be published, the Diffie-Hellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. T...
Andrew M. Odlyzko
128
Voted
DAM
2002
135views more  DAM 2002»
15 years 3 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera
ENTCS
2002
71views more  ENTCS 2002»
15 years 3 months ago
A Simplified Account of the Metatheory of Linear LF
We present a variant of the linear logical framework LLF that avoids the restriction l-typed terms be in pre-canonical form and adds -abstraction at the level of families. We aban...
Joseph Vanderwaart, Karl Crary