We investigate the problem of allocating items (private goods) among competing agents in a setting that is both prior-free and paymentfree. Specifically, we focus on allocating mu...
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
Jiawei Han, Liangliang Cao, Sangkyum Kim, Xin Jin,...
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
In this paper, we present a new algorithm to reconstruct 3D surfaces from an unorganized point cloud based on generalizing the MPU implicit algorithm through introducing a powerfu...
We improve upon a method introduced in (Bertalmio et. al. JCP 2001) for solving evolution PDEs on codimension-one surfaces in RN. As in the original method, by representing the su...