12487 search results - page 22 / 2498 » Graspable Work Modeling |
95
Voted
ISAAC
1997
Springer
15 years 4 months ago
1997
Springer
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
103
Voted
JIKM
2008
15 years 20 days ago
2008
This article describes a framework for managing the life cycle of knowledge in organisations and to utilise this framework for reusing and repurposing knowledge work. The framework...
95
Voted
AE
2001
Springer
15 years 5 months ago
2001
Springer
This is a time of increasing interdisciplinary research. Computer science is learning more from biology every day, enabling a plethora of new software techniques to flourish. And b...
84
Voted
SIGIR
2005
ACM
15 years 6 months ago
2005
ACM
To investigate the nature of people’s understandings for how search engines work, we collected data from 232 undergraduate and graduate students. Students were asked to “draw ...
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...