270 search results - page 21 / 54 » Partitioning into Sets of Bounded Cardinality |
VLSID
2003
IEEE
14 years 9 months ago
2003
IEEE
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
WADS
2005
Springer
14 years 2 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
ISPD
1999
ACM
14 years 1 months ago
1999
ACM
The presence of fixed terminals in hypergraph partitioning instances arising in top-down standard-cell placement makes such instances qualitatively different from the free hyperg...
CIKM
2005
Springer
14 years 2 months ago
2005
Springer
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
SIAMDM
2010
13 years 7 months ago
2010
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...