Sciweavers

1929 search results - page 248 / 386
» Load Balancing with Memory
Sort
View
EGH
2004
Springer
14 years 3 months ago
Squeeze: numerical-precision-optimized volume rendering
This paper discusses how to squeeze volume rendering into as few bits per operation as possible while still retaining excellent image quality. For each of the typical volume rende...
Ingmar Bitter, Neophytos Neophytou, Klaus Mueller,...
NORDSEC
2009
Springer
14 years 3 months ago
ContikiSec: A Secure Network Layer for Wireless Sensor Networks under the Contiki Operating System
In this paper we introduce ContikiSec, a secure network layer for wireless sensor networks, designed for the Contiki Operating System. ContikiSec has a configurable design, providi...
Lander Casado, Philippas Tsigas
DATE
2004
IEEE
89views Hardware» more  DATE 2004»
14 years 2 months ago
Improved Symoblic Simulation by Dynamic Funtional Space Partitioning
In this paper, we provide a flexible and automatic method to partition the functional space for efficient symbolic simulation. We utilize a 2-tuple list representation as the basi...
Tao Feng, Li-C. Wang, Kwang-Ting Cheng, Chih-Chan ...
PARLE
1987
14 years 1 months ago
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
Modern VLSI technology has changed the economic rules by which the balance between processing power, memory and communications is decided in computing systems. This will have a pr...
Peter H. Welch
SODA
2008
ACM
143views Algorithms» more  SODA 2008»
13 years 11 months ago
Dynamic optimality for skip lists and B-trees
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
Prosenjit Bose, Karim Douïeb, Stefan Langerma...