We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
Email use in the context of everyday work practices, or email flow, has not been heavily studied. We present the results of a pair of studies examining how users interlace email w...
Media sharing over mobile devices is quickly becoming a common practice, used to support a variety of social processes. Most existing systems employ a model of sharing that treats...
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
Knowledge acquisition (KA) plays an important role in building knowledge based systems (KBS). However, evaluating different KA techniques has been difficult because of the costs...