Sciweavers

364 search results - page 59 / 73
» Computing Communities in Large Networks Using Random Walks
Sort
View
CHI
2010
ACM
15 years 4 months ago
After access: challenges facing mobile-only internet users in the developing world
This study reports results of an ethnographic action research study, exploring mobile-centric internet use. Over the course of 13 weeks, eight women, each a member of a livelihood...
Shikoh Gitau, Gary Marsden, Jonathan Donner
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 2 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
NOSSDAV
2004
Springer
15 years 2 months ago
Reduced state fair queuing for edge and core routers
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...
Ramana Rao Kompella, George Varghese
ICCS
2005
Springer
15 years 3 months ago
Model-Based Statistical Testing of a Cluster Utility
Abstract. As High Performance Computing becomes more collaborative, software certification practices are needed to quantify the credibility of shared applications. To demonstrate q...
W. Thomas Swain, Stephen L. Scott
DLOG
2009
14 years 7 months ago
Testing Provers on a Grid - Framework Description
Abstract. GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests locally, in a single computer, or in a comput...
Carlos Areces, Daniel Gorín, Alejandra Lore...