Sciweavers

2391 search results - page 317 / 479
» The Complexity of Connectivity in Wireless Networks
Sort
View
SIGITE
2004
ACM
16 years 9 days ago
Experiences using tablet PCs in a programming laboratory
This experience report describes lessons learned using first generation tablet PCs to support active learning in an undergraduate computer science laboratory course. We learned th...
Stephen H. Edwards, N. Dwight Barnette
INFOCOM
2005
IEEE
16 years 14 days ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
CCR
2010
184views more  CCR 2010»
15 years 7 months ago
Characterising temporal distance and reachability in mobile and online social networks
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...
MOBIHOC
2004
ACM
16 years 6 months ago
Error characteristics of ad hoc positioning systems (aps)
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
Dragos Niculescu, Badri Nath
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
16 years 7 days ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...