Sciweavers

2186 search results - page 355 / 438
» Considering an Organization's Memory
Sort
View
IPPS
1998
IEEE
15 years 10 months ago
Locality Optimization for Program Instances
Abstract. The degree of locality of a program re ects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs ...
Claudia Leopold
PADS
1998
ACM
15 years 10 months ago
A Nonblocking Algorithm for the Distributed Simulation of FCFS Queueing Networks with Irreducible Markovian Routing
In this paper we consider the distributed simulation of queueing networks of FCFS servers with infinite buffers, and irreducible Markovian routing. We first show that for either t...
Manish Gupta 0007, Anurag Kumar
DCC
1996
IEEE
15 years 10 months ago
On the Implementation of Minimum-Redundancy Prefix Codes
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
Alistair Moffat, Andrew Turpin
FGR
1996
IEEE
186views Biometrics» more  FGR 1996»
15 years 10 months ago
Dynamical system representation, generation, and recognition of basic oscillatory motion gestures
We present a system for generation and recognition of oscillatory gestures. Inspired by gestures used in two representative human-tohuman control areas, we consider a set of oscil...
Charles J. Cohen, Lynn Conway, Daniel E. Koditsche...
PODC
1993
ACM
15 years 10 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld