We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
In this paper, we explore the discriminating subsequencebased clustering problem. First, several effective optimization techniques are proposed to accelerate the sequence mining p...
Jianyong Wang, Yuzhou Zhang, Lizhu Zhou, George Ka...
We propose a method to estimate dense motion vector fields from multi-exposure images. Our approach relies on finding a sparse set of correspondences between features in a single-...
Embedding algorithms are a method for revealing low dimensional structure in complex data. Most embedding algorithms are designed to handle objects of a single type for which pair...
Amir Globerson, Gal Chechik, Fernando Pereira, Naf...
Transfer learning concerns applying knowledge learned in one task (the source) to improve learning another related task (the target). In this paper, we use structure mapping, a ps...