Learn More
This paper presents detailed information of our solutions to the task 2 of KDD Cup 2011. The task 2 is called binary user preference prediction problem in the paper because it aims at separating tracks rated highly by specific users from tracks not rated by them, and the solutions of this task can be easily applied to binary user behavior data. In the(More)
The adsorption and desorption of Kr on graphite at temperatures in the range 60-88K, was systematically investigated using a combination of several simulation techniques including: Grand Canonical Monte Carlo (GCMC), Canonical kinetic-Monte Carlo (C-kMC) and the Mid-Density Scheme (MDS). Particular emphasis was placed on the gas-solid, gas-liquid and(More)
The interval subset sum problem (ISSP) is a generalization of the well-known subset sum problem. Given a set of intervals {[a i,1 , a i,2 ]} n i=1 and a target integer T, the ISSP is to find a set of integers, at most one from each interval, such that their sum best approximates the target T but cannot exceed it. In this paper, we first study the(More)
Based on the idea of maximum determinant positive definite matrix completion, Yamashita proposed a sparse quasi-Newton update, called MCQN, for unconstrained optimization problems with sparse Hessian structures. Such an MCQN update keeps the sparsity structure of the Hessian while relaxing the secant condition. In this paper, we propose an alternative to(More)
In this paper, we consider the problem of computing the smallest enclosing ball (SEB) of a set of m balls in R n , where the product mn is large. We first approximate the non-differentiable SEB problem by its log-exponential aggregation function and then propose a computationally efficient inexact Newton-CG algorithm for the smoothing approximation problem(More)
  • 1