Sciweavers

2773 search results - page 243 / 555
» Decomposing Social Networks
Sort
View
MOBIHOC
2010
ACM
15 years 4 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 5 months ago
Networked Computing in Wireless Sensor Networks for Structural Health Monitoring
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
Apoorva Jindal, Mingyan Liu
CORR
2011
Springer
194views Education» more  CORR 2011»
15 years 1 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...
CSE
2009
IEEE
16 years 1 months ago
How Did You Get to Know That? A Traceable Word-of-Mouth Algorithm
Word-of-mouth communication has been shown to play a key role in a variety of environments such as viral marketing and virus spreading. A family of algorithms, generally known as ...
Manuel Cebrián, Enrique Frías-Mart&i...
ASUNAM
2011
IEEE
14 years 6 months ago
MultiAspectForensics: Pattern Mining on Large-Scale Heterogeneous Networks with Tensor Analysis
—Modern applications such as web knowledge base, network traffic monitoring and online social networks have made available an unprecedented amount of network data with rich type...
Koji Maruhashi, Fan Guo, Christos Faloutsos