7978 search results - page 351 / 1596 » Representation before computation |
171
click to vote
ECAL
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In this paper, a computational model of a successful negotiated communication system is presented, in which language agents develop their own meanings in response to thei...
189
click to vote
UAI
2001
15 years 8 months ago
2001
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
173
click to vote
CNL
2009
15 years 7 months ago
2009
Controlled natural languages (CNL) and computational semantics in general do not address word sense disambiguation, i.e., they tend to interpret only some functional words that are...
172
click to vote
AAECC
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel...
173
click to vote
AMC
2006
15 years 6 months ago
2006
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication. Based on the double-base chain representation of scalar using...