A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
A set XN of N points on the unit sphere is a spherical t-design if the average value of any polynomial of degree at most t over XN is equal to the average value of the polynomial o...
Congpei An, Xiaojun Chen, Ian H. Sloan, Robert S. ...
This paper concerns the characterization of clouds on meteorological satellite image sequences through points trajectories. These temporal curves can be computed from the result o...
Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation ...
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...