6202 search results - page 359 / 1241 » Without Loss of Generality |
203
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
172
click to vote
CRYPTO
1991
Springer
15 years 10 months ago
1991
Springer
In this paper, we study the application of universal hashingto the construction of unconditionally secure authentication codes without secrecy. This idea is most useful when the nu...
168
click to vote
BMVC
2001
15 years 9 months ago
2001
Combining different and complementary object models promises to increase the robustness and generality of today’s computer vision algorithms. This paper introduces a new method ...
206
click to vote
AAAI
2007
15 years 9 months ago
2007
In this paper, we explore the hypothesis that episodic memory is a critical component for cognitive architectures that support general intelligence. Episodic memory overlaps with ...
155
Voted
AAAI
2008
15 years 9 months ago
2008
We propose an opponent modeling approach for no-limit Texas hold-em poker that starts from a (learned) prior, i.e., general expectations about opponent behavior and learns a relat...