Sciweavers

12487 search results - page 22 / 2498
» Graspable Work Modeling
Sort
View
ISAAC
1997
Springer
162views Algorithms» more  ISAAC 1997»
13 years 11 months ago
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
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...
Chung Keung Poon, Vijaya Ramachandran
JIKM
2008
89views more  JIKM 2008»
13 years 7 months ago
A Framework for Reusing and Repurposing Knowledge Work in Organisations
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...
Mark W. Salisbury
AE
2001
Springer
13 years 12 months ago
Why Biologists and Computer Scientists Should Work Together
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...
Peter J. Bentley
SIGIR
2005
ACM
14 years 29 days ago
Search engines and how students think they work
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 ...
Efthimis N. Efthimiadis, David G. Hendry
IPPS
1997
IEEE
13 years 11 months ago
Work-Time Optimal K-Merge Algorithms on the PRAM
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...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu