Abstract: Biclustering is the way of two-dimensional data
analysis. For several years it became possible to express such issue
in terms of Boolean reasoning, for processing continuous, discrete
and binary data. The mathematical backgrounds of such approach —
proved ability of induction of exact and inclusion–maximal biclusters
fulfilling assumed criteria — are strong advantages of the method.
Unfortunately, the core of the method has quite high computational
complexity. In the paper the basics of Boolean reasoning approach
for biclustering are presented. In such context the problems of
computation parallelization are risen.
Abstract: Automatic detection of facial feature points plays
an important role in applications such as facial feature tracking,
human-machine interaction and face recognition. The majority of
facial feature points detection methods using two-dimensional or
three-dimensional data are covered in existing survey papers. In
this article chosen approaches to the facial features detection have
been gathered and described. This overview focuses on the class
of researches exploiting facial feature points detection to represent
facial surface for two-dimensional or three-dimensional face. In
the conclusion, we discusses advantages and disadvantages of the
presented algorithms.