For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...
- In this paper, we propose a Multiobjective Self-adaptive Differential Evolution algorithm with objective-wise learning strategies (OW-MOSaDE) to solve numerical optimization pr...
Vicky Ling Huang, Shuguang Z. Zhao, Rammohan Malli...
In this paper, we present a fast mode decision algorithm for H.264/AVC intra prediction. The goal of this work is to reduce computational complexity of the H.264 encoder without s...
In the paper we present new Alternating Least Squares (ALS) algorithms for Nonnegative Matrix Factorization (NMF) and their extensions to 3D Nonnegative Tensor Factorization (NTF) ...