Protocols that provide reliable communicationon top of a network that can lose packets rely on periodically retransmitting packets. The choice of retransmission timeout critically...
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
Multiple Kernel Learning (MKL) can be formulated as a convex-concave minmax optimization problem, whose saddle point corresponds to the optimal solution to MKL. Most MKL methods e...
Zenglin Xu, Rong Jin, Shenghuo Zhu, Michael R. Lyu...
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...