Sciweavers

933 search results - page 171 / 187
» Centrality Estimation in Large Networks
Sort
View
COR
2008
142views more  COR 2008»
14 years 9 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
ICWSM
2009
14 years 7 months ago
Content Based Recommendation and Summarization in the Blogosphere
This paper presents a stochastic graph based method for recommending or selecting a small subset of blogs that best represents a much larger set. within a certain topic. Each blog...
Ahmed Hassan, Dragomir R. Radev, Junghoo Cho, Amru...
JSAC
2011
142views more  JSAC 2011»
14 years 4 months ago
A Distributed Key Management Framework with Cooperative Message Authentication in VANETs
Abstract—In this paper, we propose a distributed key management framework based on group signature to provision privacy in vehicular ad hoc networks (VANETs). Distributed key man...
Yong Hao, Yu Cheng, Chi Zhou, Wei Song
PODC
2012
ACM
13 years 1 days ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
MOBICOM
2012
ACM
13 years 2 days ago
Argos: practical many-antenna base stations
Multi-user multiple-input multiple-output theory predicts manyfold capacity gains by leveraging many antennas on wireless base stations to serve multiple clients simultaneously th...
Clayton Shepard, Hang Yu, Narendra Anand, Erran Li...