Sciweavers

2555 search results - page 425 / 511
» Quantifiers and Working Memory
Sort
View
FAST
2003
15 years 5 months ago
Block-Level Security for Network-Attached Disks
We propose a practical and efficient method for adding security to network-attached disks (NADs). In contrast to previous work, our design requires no changes to the data layout ...
Marcos Kawazoe Aguilera, Minwen Ji, Mark Lillibrid...
WSCG
2004
165views more  WSCG 2004»
15 years 5 months ago
A Client-Server-Scenegraph for the Visualization of Large and Dynamic 3D Scenes
With the increasing capabilities of hardware for 3D graphics and network, 3D multi-user environments get more and more interesting for e-business, entertainment and cooperative wo...
Jörg Sahm, Ingo Soetebier
DAGSTUHL
2000
15 years 5 months ago
Vision and Touch for Grasping
This paper introduces our one-armed stationary humanoid robot GripSee together with research projects carried out on this platform. The major goal is to have it analyze a table sce...
Rolf P. Würtz
MASCOTS
2000
15 years 5 months ago
Stateless Routing in Network Simulations
The memory resources required by network simulations can grow quadratically with size of the simulated network. In simulations that use routing tables at each node to perform perh...
George F. Riley, Mostafa H. Ammar, Richard Fujimot...
IJCAI
1997
15 years 5 months ago
Interleaved Depth-First Search
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
Pedro Meseguer