12194 search results - page 81 / 2439 » Numberings Optimal for Learning |
DAM
2007
15 years 17 days ago
2007
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
105
Voted
APSCC
2008
IEEE
15 years 7 months ago
2008
IEEE
— We discuss a learning model that enables the creation of optimal learning strategies that suit learners’ needs. A customized learning content is delivered to learners as mana...
121
Voted
GFKL
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
113
click to vote
ICIC
2005
Springer
15 years 6 months ago
2005
Springer
This paper proposes two methods which take advantage of k -mean clustering algorithm to decrease the number of support vectors (SVs) for the training of support vector machine (SVM...
89
Voted
ICPR
2000
IEEE
16 years 1 months ago
2000
IEEE
This paper proposes a method for face reconstruction that makes use of only a small set of feature points. Faces can be modeled by forming linear combinations of prototypes of sha...