728 search results - page 114 / 146 » Compressing combinatorial objects |
AMCS
2008
13 years 10 months ago
2008
Principal component analysis (PCA) is a powerful fault detection and isolation method. However, the classical PCA which is based on the estimation of the sample mean and covariance...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
COMGEO
2006
ACM
13 years 9 months ago
2006
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementat...
JAIR
2007
13 years 9 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...