Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions...
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
Content-based signatures are designed to be a robust bitstream representation of the content so as to enable content identi cation even though the original content may go through ...
Effort prediction is a very important issue for software project management. Historical project data sets are frequently used to support such prediction. But missing data are oft...
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...