81 search results - page 9 / 17 » A Shortest Learning Path Selection Algorithm in E-learning |
157
Voted
GIS
2009
ACM
15 years 10 months ago
2009
ACM
This paper looks at the problem of data prioritization, commonly found in mobile ad-hoc networks. The proposed general solution uses a machine learning approach in order to learn ...
176
Voted
INFOCOM
2007
IEEE
16 years 3 days ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
156
click to vote
ICML
2005
IEEE
16 years 6 months ago
2005
IEEE
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
197
click to vote
NIPS
2004
15 years 7 months ago
2004
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
158
Voted
INFOCOM
2002
IEEE
15 years 10 months ago
2002
IEEE
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...