Sciweavers

2512 search results - page 112 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
CE
2008
91views more  CE 2008»
14 years 10 months ago
Mining e-Learning domain concept map from academic articles
Recent researches have demonstrated the importance of concept map and its versatile applications especially in e-Learning. For example, while designing adaptive learning materials...
Nian-Shing Chen, Kinshuk, Chun-Wang Wei, Hong-Jhe ...
HPDC
1997
IEEE
15 years 1 months ago
A Directory Service for Configuring High-Performance Distributed Computations
High-performance execution in distributed computing environments often requires careful selection and configuration not only of computers, networks, and other resources but also o...
Steven Fitzgerald, Ian T. Foster, Carl Kesselman, ...
ICCV
2005
IEEE
15 years 3 months ago
Visual Learning Given Sparse Data of Unknown Complexity
This study addresses the problem of unsupervised visual learning. It examines existing popular model order selection criteria before proposes two novel criteria for improving visu...
Tao Xiang, Shaogang Gong
SIGIR
2003
ACM
15 years 3 months ago
ReCoM: reinforcement clustering of multi-type interrelated data objects
Most existing clustering algorithms cluster highly related data objects such as Web pages and Web users separately. The interrelation among different types of data objects is eith...
Jidong Wang, Hua-Jun Zeng, Zheng Chen, Hongjun Lu,...
EAAI
2007
90views more  EAAI 2007»
14 years 10 months ago
AI techniques in modelling, assignment, problem solving and optimization
This paper recapitulates the results of a long research on a family of artificial intelligence (AI) methods—relying on, e.g., artificial neural networks and search techniques...
Zsolt János Viharos, Zsolt Kemény