Sciweavers

1391 search results - page 15 / 279
» Distributed routing in networks using affinity propagation
Sort
View
KDD
2009
ACM
164views Data Mining» more  KDD 2009»
16 years 8 days ago
Social influence analysis in large-scale networks
In large social networks, nodes (users, entities) are influenced by others for various reasons. For example, the colleagues have strong influence on one's work, while the fri...
Jie Tang, Jimeng Sun, Chi Wang, Zi Yang
ICC
2007
IEEE
15 years 6 months ago
Optimal Distributed Multicast Routing using Network Coding
—Multicast is an important communication paradigm, also a problem well known for its difficulty (NP-completeness) to achieve certain optimization goals, such as minimum network ...
Yi Cui, Yuan Xue, Klara Nahrstedt
WCNC
2008
IEEE
15 years 6 months ago
Mitigation of the Propagation of Localization Error Using Multi-Hop Bounding
Abstract—In ad hoc position-location networks, location information is obtained through the sequential estimation of node locations. An unlocalized node can estimate its location...
R. Michael Buehrer, Swaroop Venkatesh, Tao Jia
ICDCS
2005
IEEE
15 years 5 months ago
Handling Asymmetry in Power Heterogeneous Ad Hoc Networks: A Cross Layer Approach
Power heterogeneous ad hoc networks are characterized by link layer asymmetry: the ability of lower power nodes to receive transmissions from higher power nodes but not vice versa...
Vasudev Shah, Srikanth V. Krishnamurthy
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
15 years 1 months ago
End-to-end packet-scheduling in wireless ad-hoc networks
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...