Sciweavers

761 search results - page 42 / 153
» Metadata Principles and Practicalities
Sort
View
UAI
1993
13 years 11 months ago
Using Causal Information and Local Measures to Learn Bayesian Networks
In previous work we developed a method of learning Bayesian Network models from raw data. This method relies on the well known minimal description length (MDL) principle. The MDL ...
Wai Lam, Fahiem Bacchus
WMTE
2002
IEEE
14 years 2 months ago
Mobile Internet Usability: What Can 'Mobile Learning' Learn from the Past?
‘Mobile Learning’ is a type of application/service that generally presumes to use mobile Internet technology for learning purposes. This paper focuses on discussing basic usab...
Maria Uther
EOR
2006
97views more  EOR 2006»
13 years 10 months ago
A simulated annealing and hill-climbing algorithm for the traveling tournament problem
The Traveling Tournament Problem (TTP) [E. Easton, G. Nemhauser, M. Trick, The traveling tournament problem description and benchmarks, in: Proceedings of the 7th International Co...
Andrew Lim, Brian Rodrigues, X. Zhang
JETAI
2002
71views more  JETAI 2002»
13 years 9 months ago
Comparing performance of algorithms for generating concept lattices
Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed. Algo...
Sergei O. Kuznetsov, Sergei A. Obiedkov
JCDL
2006
ACM
143views Education» more  JCDL 2006»
14 years 3 months ago
Categorizing web search results into meaningful and stable categories using fast-feature techniques
When search results against digital libraries and web resources have limited metadata, augmenting them with meaningful and stable category information can enable better overviews ...
Bill Kules, Jack Kustanowitz, Ben Shneiderman