270 search results - page 16 / 54 » Partitioning into Sets of Bounded Cardinality |
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
The binary set splitting with k-d trees (BISK) algorithm is introduced. An embedded wavelet-based image coder based on the popular bitplane-coding paradigm, BISK is designed speci...
ENTCS
2006
13 years 7 months ago
2006
In this paper we describe an algorithm for distributed, BDD-based bounded property checking and its implementation in the verification tool SymC. The distributed algorithm verifie...
ICALP
2001
Springer
14 years 1 days ago
2001
Springer
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...
TKDE
2010
13 years 6 months ago
2010
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
ACID
2006
13 years 9 months ago
2006
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...