Sciweavers

1476 search results - page 185 / 296
» Designing Communication-intensive Web Applications: a Case S...
Sort
View
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
HICSS
2008
IEEE
119views Biometrics» more  HICSS 2008»
16 years 24 days ago
Eliciting and Validating Knowledge in Knowledge Management Systems
This article identifies two significant challenges in implementing Knowledge Management Systems (KMS), then, proposes solutions based on information economics. A knowledge market ...
Hind Benbya, Marshall W. van Alstyne
WWW
2009
ACM
16 years 7 months ago
Using graphics processors for high performance IR query processing
Web search engines are facing formidable performance challenges as they need to process thousands of queries per second over billions of documents. To deal with this heavy workloa...
Shuai Ding, Jinru He, Hao Yan, Torsten Suel
ACE
2003
180views Education» more  ACE 2003»
15 years 7 months ago
Managing the managers: Collaborative virtual teams with large staff and student numbers
Virtual teaming involving online presentations and peer reviews support the notion of collaborative student learning, whilst preparing them for the virtual work environment. Howev...
Kathy Egea
SIGIR
2011
ACM
14 years 9 months ago
Social context summarization
We study a novel problem of social context summarization for Web documents. Traditional summarization research has focused on extracting informative sentences from standard docume...
Zi Yang, Keke Cai, Jie Tang, Li Zhang, Zhong Su, J...