Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Other Computer Sciences
A Study Of Sparse Representation Of Boolean Functions, Yekun Xu
A Study Of Sparse Representation Of Boolean Functions, Yekun Xu
FIU Electronic Theses and Dissertations
Boolean function is one of the most fundamental computation models in theoretical computer science. The two most common representations of Boolean functions are Fourier transform and real polynomial form. Applying analytic tools under these representations to the study Boolean functions has led to fruitful research in many areas such as complexity theory, learning theory, inapproximability, pseudorandomness, metric embedding, property testing, threshold phenomena, social choice, etc. In this thesis, we focus on \emph{sparse representations} of Boolean function in both Fourier transform and polynomial form, and obtain the following new results. A classical result of Rothschild and van Lint asserts that if …
A Generalized Adaptive Mathematical Morphological Filter For Lidar Data, Zheng Cui
A Generalized Adaptive Mathematical Morphological Filter For Lidar Data, Zheng Cui
FIU Electronic Theses and Dissertations
Airborne Light Detection and Ranging (LIDAR) technology has become the primary method to derive high-resolution Digital Terrain Models (DTMs), which are essential for studying Earth’s surface processes, such as flooding and landslides. The critical step in generating a DTM is to separate ground and non-ground measurements in a voluminous point LIDAR dataset, using a filter, because the DTM is created by interpolating ground points. As one of widely used filtering methods, the progressive morphological (PM) filter has the advantages of classifying the LIDAR data at the point level, a linear computational complexity, and preserving the geometric shapes of terrain features. …