Sciweavers

598 search results - page 85 / 120
» A random graph model for massive graphs
Sort
View
MOBIHOC
2012
ACM
13 years 2 months ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang
JITECH
2010
106views more  JITECH 2010»
14 years 10 months ago
Patterns and structures of intra-organizational learning networks within a knowledge-intensive organization
This paper employs the network perspective to study patterns and structures of intraorganizational learning networks. The theoretical background draws from cognitive theories, the...
Miha Skerlavaj, Vlado Dimovski, Kevin C. Desouza
CN
2010
103views more  CN 2010»
14 years 12 months ago
Continuum equilibria and global optimization for routing in dense static ad hoc networks
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
Alonso Silva, Eitan Altman, Pierre Bernhard, M&eac...
JMLR
2012
13 years 2 months ago
Low rank continuous-space graphical models
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
Carl Smith, Frank Wood, Liam Paninski
110
Voted
TPDS
2010
109views more  TPDS 2010»
14 years 10 months ago
Distributed Network Formation for n-Way Broadcast Applications
—In an n-way broadcast application, each one of n overlay nodes wants to push its own distinct large data file to all other n À 1 destinations as well as download their respecti...
Georgios Smaragdakis, Nikolaos Laoutaris, Pietro M...