Sciweavers

11862 search results - page 2005 / 2373
» Relative information completeness
Sort
View
COLT
2007
Springer
16 years 29 days ago
Minimax Bounds for Active Learning
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...
Rui Castro, Robert D. Nowak
CONTEXT
2007
Springer
16 years 29 days ago
Adaptive and Context-aware Scenarios for Technology Enhanced Learning System based on a Didactical Theory and a Hierarchical Tas
Among the main issues of future technology-enhanced learning systems, we can mention the following ones: the ability to reuse learning resources (learning objects, tools and servic...
Jean-Louis Tetchueng, Serge Garlatti, Sylvain Laub...
DAWAK
2007
Springer
16 years 29 days ago
MOSAIC: A Proximity Graph Approach for Agglomerative Clustering
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
Jiyeon Choo, Rachsuda Jiamthapthaksin, Chun-Sheng ...
DAWAK
2007
Springer
16 years 29 days ago
OLAP Technology for Business Process Intelligence: Challenges and Solutions
The emerging area of business process intelligence aims at enhancing the analysis power of business process management systems by employing data warehousing and mining technologies...
Svetlana Mansmann, Thomas Neumuth, Marc H. Scholl
ECAL
2007
Springer
16 years 29 days ago
Spatial Embedding and Complexity: The Small-World Is Not Enough
The “order for free” exhibited by some classes of system has been exploited by natural selection in order to build systems capable of exhibiting complex behaviour. Here we expl...
Christopher L. Buckley, Seth Bullock
« Prev « First page 2005 / 2373 Last » Next »