Sciweavers

728 search results - page 60 / 146
» Concept Maps and Learning Objects
Sort
View
SAC
2005
ACM
14 years 2 months ago
Rearranging data objects for efficient and stable clustering
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
Gyesung Lee, Xindong Wu, Jinho Chon
ECAL
2001
Springer
14 years 1 months ago
Pareto Optimality in Coevolutionary Learning
We develop a novel coevolutionary algorithm based upon the concept of Pareto optimality. The Pareto criterion is core to conventional multi-objective optimization (MOO) algorithms....
Sevan G. Ficici, Jordan B. Pollack
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 9 months ago
Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization
Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously diffic...
Daniel Golovin, Andreas Krause
ICMCS
2007
IEEE
145views Multimedia» more  ICMCS 2007»
14 years 3 months ago
An Interactive 3D Environment for Computer Based Education
Individual learning capabilities can vary from gifted to exceptionally slow; some students may take longer to understand a concept and may not be able to achieve the expected stan...
Gang Wu, Irene Cheng
CVPR
2004
IEEE
14 years 10 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...