Sciweavers

24529 search results - page 4820 / 4906
» Computing on Authenticated Data
Sort
View
VLDB
1998
ACM
127views Database» more  VLDB 1998»
14 years 2 months ago
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...
SIGCOMM
1997
ACM
14 years 2 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
FGR
1996
IEEE
198views Biometrics» more  FGR 1996»
14 years 2 months ago
Towards 3D hand tracking using a deformable model
In this paper we rst describe how we have constructed a 3D deformable Point Distribution Model of the human hand, capturing training data semi-automatically from volume images via...
Tony Heap, David Hogg
ISCA
1993
IEEE
112views Hardware» more  ISCA 1993»
14 years 2 months ago
Working Sets, Cache Sizes, and Node Granularity Issues for Large-Scale Multiprocessors
The distribution of resources among processors, memory and caches is a crucial question faced by designers of large-scale parallel machines. If a machine is to solve problems with...
Edward Rothberg, Jaswinder Pal Singh, Anoop Gupta
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
14 years 2 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
« Prev « First page 4820 / 4906 Last » Next »