5254 search results - page 871 / 1051 » The Evaluation of Courses in Information Systems |
135
click to vote
CIKM
2010
Springer
15 years 10 days ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
102
click to vote
WCRE
2010
IEEE
15 years 2 days ago
2010
IEEE
—Automatic and advanced merging algorithms help programmers to merge their modifications in main development repositories. However, there is little support to help release maste...
108
click to vote
CHI
2005
ACM
16 years 2 months ago
2005
ACM
Rapid growth in the scientific literature makes it increasingly difficult for scientists to keep abreast of findings outside their own narrowing fields of expertise. To help biome...
121
click to vote
CCS
2007
ACM
15 years 8 months ago
2007
ACM
In this paper, we study the maintenance of role-based access control (RBAC) models in database environments using transitive closure relations. In particular, the algorithms that ...
100
click to vote
SIGIR
2005
ACM
15 years 7 months ago
2005
ACM
We present a model, based on the maximum entropy method, for analyzing various measures of retrieval performance such as average precision, R-precision, and precision-at-cutoffs....