Given a complete graph Kn = (V, E) with edge weight ce on each edge, we consider the problem of partitioning the vertices of graph Kn into subcliques that have at least S vertices, so as to minimizeâ€¦ (More)

Given a complete graph Kn = (V, E), with edge weight ce on each edge, we consider the problem of partitioning the vertices of graph Kn into subcliques that each have at least S vertices, so as toâ€¦ (More)

The 2006 IEEE International Joint Conference onâ€¦

2006

A key step in many statistical learning methods used in machine learning involves solving a convex optimization problem containing one or more hyper-parameters that must be selected by the users.â€¦ (More)

The sports team realignment problem can be modelled as k-way equipartition: given a complete graph Kn = (V, E), with edge weight ce on each edge, partition the vertices V into k divisions that haveâ€¦ (More)

The multimedia teaching software generally includes the outputs of the text, picture; The broadcasting of the sound, image, cartoon; the hypertext; Making and output of the database. This textâ€¦ (More)

2011 International Conference on Computer Scienceâ€¦

2011

In the VB Programming teaching, author combined with own teaching experience discuss several teaching method, such as case teaching method, goal-driven method, related case teaching, and study theâ€¦ (More)