Sciweavers

917 search results - page 10 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
AIEDU
2005
185views more  AIEDU 2005»
13 years 7 months ago
A Bayesian Student Model without Hidden Nodes and its Comparison with Item Response Theory
The Bayesian framework offers a number of techniques for inferring an individual's knowledge state from evidence of mastery of concepts or skills. A typical application where ...
Michel C. Desmarais, Xiaoming Pu
AMW
2010
13 years 9 months ago
Certification and Authentication of Data Structures
We study query authentication schemes, algorithmic and cryptographic constructions that provide efficient and secure protocols for verifying the results of queries over structured...
Roberto Tamassia, Nikos Triandopoulos
ICCS
2005
Springer
14 years 1 months ago
Morphisms in Context
Abstract. Morphisms constitute a general tool for modelling complex relationships between mathematical objects in a disciplined fashion. In Formal Concept Analysis (FCA), morphisms...
Markus Krötzsch, Pascal Hitzler, Guo-Qiang Zh...
JSA
2006
114views more  JSA 2006»
13 years 7 months ago
Distributed computing using Java: A comparison of two server designs
This paper proposes a new concurrent data structure, called parallel hash table, for synchronizing the access of multiple threads to resources stored in a shared buffer. We prove ...
Boris Roussev, Jie Wu
AMAI
2007
Springer
13 years 7 months ago
Relational concept discovery in structured datasets
Relational datasets, i.e., datasets in which individuals are described both by their own features and by their relations to other individuals, arise from various sources such as d...
Marianne Huchard, Mohamed Rouane Hacene, Cyril Rou...