Sciweavers

5056 search results - page 446 / 1012
» Network Coding Theory
Sort
View
MOBIHOC
2005
ACM
16 years 4 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
CSCW
2004
ACM
15 years 10 months ago
Six degrees of jonathan grudin: a social network analysis of the evolution and impact of CSCW research
In this paper, we describe the evolution and impact of computersupported cooperative work (CSCW) research through social network analysis of coauthorship data. A network of author...
Daniel B. Horn, Thomas A. Finholt, Jeremy P. Birnh...
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 9 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...
DAI
1995
Springer
15 years 8 months ago
A Formal View of Social Dependence Networks
In response to the problems that have arisen regarding the terminology and concepts of agent-oriented systems, previous work has described a formal framework for understanding agen...
Mark d'Inverno, Michael Luck
DIALM
2010
ACM
194views Algorithms» more  DIALM 2010»
15 years 2 months ago
Prioritized gossip in vehicular networks
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
Alejandro Cornejo, Calvin C. Newport