Sciweavers

2479 search results - page 383 / 496
» A Computational Theory of Working Memory
Sort
View
CDC
2009
IEEE
117views Control Systems» more  CDC 2009»
15 years 11 months ago
Information dissemination in networks via linear iterative strategies over finite fields
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
Shreyas Sundaram, Christoforos N. Hadjicostis
CVPR
2000
IEEE
15 years 10 months ago
Geodesic Distance Evolution of Surfaces: A New Method for Matching Surfaces
The general problem of surface matching is taken up in this study. The process described in this work hinges on a geodesic distance equation for a family of surfaces embedded in t...
Hussein M. Yahia, Etienne G. Huot, Isabelle Herlin...
160
Voted
UIST
1999
ACM
15 years 10 months ago
The Role of Kinesthetic Reference Frames in Two-Handed Input Performance
We present experimental work which explores how the match (or mismatch) between the input space of the hands and the output space of a graphical display influences twohanded input...
Ravin Balakrishnan, Ken Hinckley
SP
1989
IEEE
160views Security Privacy» more  SP 1989»
15 years 10 months ago
The Chinese Wall Security Policy
Everyone who has seen the movie Wall Street will have seen a commercial security policy in action. The recent work of Clark and Wilson and the WIPCIS initiative (the Workshop on I...
D. F. C. Brewer, M. J. Nash
COCO
2010
Springer
152views Algorithms» more  COCO 2010»
15 years 10 months ago
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
Derrick Stolee, Chris Bourke, N. V. Vinodchandran