4212 search results - page 214 / 843 » On Compressible Pairings and Their Computation |
165
click to vote
TON
2002
15 years 6 months ago
2002
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
242
click to vote
IWQOS
2011
Springer
14 years 9 months ago
2011
Springer
—Quality-of-service (QoS) management often requires a continuous monitoring service to provide updated information about different hosts and network links in the managed system. ...
187
Voted
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
In this paper we present a system for classifying various human actions in compressed domain video framework. We introduce the notion of quantifying the motion involved, through w...
154
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
Scratch-pad memories (SPMs) enable fast access to time-critical data. While prior research studied both static and dynamic SPM management strategies, not being able to keep all ho...
158
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...