Sciweavers

1282 search results - page 176 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
ICC
2007
IEEE
113views Communications» more  ICC 2007»
15 years 10 months ago
Complexity and Error Propagation of Localization Using Interferometric Ranging
— An interferometric ranging technique has been recently proposed as a possible way to localize ad hoc and sensor networks. Compared to the more common techniques such as receive...
Rui Huang, Gergely V. Záruba, Manfred Huber
SIAMSC
2010
116views more  SIAMSC 2010»
15 years 2 months ago
Recursively Accelerated Multilevel Aggregation for Markov Chains
A recursive acceleration method is proposed for multiplicative multilevel aggregation algorithms that calculate the stationary probability vector of large, sparse, and irreducible ...
Hans De Sterck, K. Miller, G. Sanders, M. Winlaw
INFOCOM
2009
IEEE
15 years 11 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
CIKM
2008
Springer
15 years 6 months ago
Summarization of social activity over time: people, actions and concepts in dynamic networks
We present a framework for automatically summarizing social group activity over time. The problem is important in understanding large scale online social networks, which have dive...
Yu-Ru Lin, Hari Sundaram, Aisling Kelliher
SIGMETRICS
2012
ACM
257views Hardware» more  SIGMETRICS 2012»
13 years 6 months ago
Fair sampling across network flow measurements
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
Nick G. Duffield