Sciweavers

3017 search results - page 443 / 604
» On compressing social networks
Sort
View
INFOCOM
2005
IEEE
16 years 6 days ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
JSAC
2011
185views more  JSAC 2011»
15 years 1 months ago
Joint Dynamic Resource Allocation and Waveform Adaptation for Cognitive Networks
This paper investigates the issue of dynamic resource allocation (DRA) in the context of multiuser cognitive radio networks. We present a general framework adopting generalized si...
Zhi Tian, Geert Leus, Vincenzo Lottici
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
16 years 7 months ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...
188
Voted
PKAW
2010
15 years 5 months ago
Finding Relation between PageRank and Voter Model
Abstract. Estimating influence of a node is an important problem in social network analyses. We address this problem in a particular class of model for opinion propagation in whic...
Takayasu Fushimi, Kazumi Saito, Masahiro Kimura, H...
INFOCOM
2009
IEEE
16 years 1 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar