Sciweavers

11328 search results - page 1996 / 2266
» Timed Branching Processes
Sort
View
SIGCOMM
1997
ACM
15 years 8 months ago
Consistent Overhead Byte Stuffing
—Byte stuffing is a process that encodes a sequence of data bytes that may contain ‘illegal’ or ‘reserved’ values, using a potentially longer sequence that contains no oc...
Stuart Cheshire, Mary Baker
IPPS
1996
IEEE
15 years 8 months ago
Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study
This paper presents e cient and portable implementations of a useful image enhancement process, the Symmetric Neighborhood Filter SNF, and an image segmentation technique which ma...
David A. Bader, Joseph JáJá, David H...
VLDB
1997
ACM
126views Database» more  VLDB 1997»
15 years 8 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
PDIS
1993
IEEE
15 years 8 months ago
Log-Based Directory Resolution in the Coda File System
semantic knowledge all concurrent partitionedAbstract updates to an object must be treated as conflicting, andOptimistic replication is an important technique for merged manually b...
Puneet Kumar, Mahadev Satyanarayanan
CHI
1993
ACM
15 years 8 months ago
Exploring the applications of user-expertise assessment for intelligent interfaces
An adaptive user interface relies, to a large extent, upon an adequate user model (e.g., a representationof user-expertise). However, building a user model may be a tedious and ti...
Michel Desmarais, Jiming Liu
« Prev « First page 1996 / 2266 Last » Next »