For a set of distances D = {d1, . . . , dk} a set A is called D-avoiding if no pair of points of A is at distance di for some i. We show that the density of A is exponentially sma...
Abstract—Localization is one of the most challenging and important issues in wireless sensor networks (WSNs), especially if cost-effective approaches are demanded. In this paper,...
In this paper we investigate the Erd¨os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We pr...
In this paper, an evolutionary clustering technique is described that uses a new point symmetry-based distance measure. The algorithm is therefore able to detect both convex and n...
: Business processes continue to play an important role in today’s service-oriented enterprise computing systems. Mining, discovering, and integrating process-oriented services h...
Joonsoo Bae, Ling Liu, James Caverlee, Liang-Jie Z...