Sciweavers

2479 search results - page 445 / 496
» A Computational Theory of Working Memory
Sort
View
FCT
1997
Springer
15 years 10 months ago
Trade-Off Results for Connection Management
A connection management protocol establishes a connection between two hosts across a wide-area network to allow reliable message delivery. Following previous work of Kleinberg et a...
Marios Mavronicolas, Nikos Papadakis
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 10 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
ACMSE
2006
ACM
15 years 9 months ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar
SIGGRAPH
2010
ACM
15 years 9 months ago
Camouflage images
Camouflage images contain one or more hidden figures that remain imperceptible or unnoticed for a while. In one possible explanation, the ability to delay the perception of the hi...
Hung-Kuo Chu, Wei-Hsin Hsu, Niloy J. Mitra, Daniel...
ARTMED
2008
108views more  ARTMED 2008»
15 years 6 months ago
Drinking from the firehose of experience
The problem of consciousness has captured the imagination of philosophers, neuroscientists, and the general public, but has received little attention within AI. However, concepts ...
Benjamin Kuipers