Sciweavers

2479 search results - page 191 / 496
» A Computational Theory of Working Memory
Sort
View
AGP
1999
IEEE
14 years 1 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
AR
2007
138views more  AR 2007»
13 years 9 months ago
Integrating robotics and neuroscience: brains for robots, bodies for brains
—Researchers in robotics and artificial intelligence have often looked at biology as a source of inspiration for solving their problems. From the opposite perspective, neuroscie...
Michele Rucci, Daniel Bullock, Fabrizio Santini
CHI
2005
ACM
14 years 9 months ago
Patterns of media use in an activity-centric collaborative environment
This paper describes a new collaboration technology that is based on the support of lightweight, informally structured, opportunistic activities featuring heterogeneous threads of...
David R. Millen, Michael J. Muller, Werner Geyer, ...
EMMCVPR
2001
Springer
14 years 1 months ago
A Double-Loop Algorithm to Minimize the Bethe Free Energy
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
Alan L. Yuille
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 9 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel